Hello everyone!

I have a couple of question related with Flows, I wish you can help me

Is Dinic the best algorithm know so far for calculating Max Flow?
Is Hopcroft–Karp the best algorithm known so far for calculating Bitartite Matching?
Could you please recommend me some references for those algorithms?

Thank you all.

Hi everyone! 

I hope you are doing well, I wanted to ask you if you can recommend me some papers about Graph Theory, they are for my algorithm class, we are going to analyze some of them, and I'm looking for some nice papers about graph algorithms, I'm really interested in find some about **Flow Theory**, I hope you can help me recommend me some good ones... not only about flows, but another topic would be great too. 

Thank you everyone!