Revision as of 23:44, 5 March 2009 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits m →References: -cat ← Previous edit		Revision as of 23:45, 5 March 2009 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits →References: -</ref> Next edit →
Line 34: ==References== {{citation\|first1=Ravindra K.\|last1=Ahuja\|first2=Thomas L.\|last2=Magnanti\|first3=James B.\|last3=Orlin\|title=Network Flows: Theory, Algorithms and Applications\|publisher=Prentice-Hall\|year=1993}}. {{citation\|first1=John E.\|last1=Hopcroft\|author1-link=John Hopcroft\|first2=Richard M.\|last2=Karp\|author2-link=Richard Karp\|title=An ''n''<sup>5/2</sup> algorithm for maximum matchings in bipartite graphs\|journal=SIAM Journal on Computing\|volume=2\|issue=4\|pages=225–231\|year=1973\|doi=10.1137/0202019}}.~~</ref>~~ [[Category:Graph algorithms]]

Hopcroft–Karp algorithm: Difference between revisions