Revision as of 16:49, 10 November 2007 edit Tim32 (talk \| contribs) 855 edits mNo edit summary ← Previous edit		Revision as of 17:03, 10 November 2007 edit undo Tim32 (talk \| contribs) 855 edits →References: + Ref Next edit →
Line 14: * {{cite book \| author = [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]] \| title = [[Introduction to Algorithms]] \| origyear = 1990 \| edition = 2nd edition \| year = 2001 \| publisher = MIT Press and McGraw-Hill \| pages = 696-697 \| chapter = 26 \| id = ISBN 0-262-03293-7}} * Even S., Kariv O., ''An O(n<sup>5/2</sup>) algorithm for maximum matching in general graphs'', Proc. 16th Annual Symp. of Foundations of Computer Sci., IEEE, 1975, p. 100-112. <references />

Hopcroft–Karp algorithm: Difference between revisions