Hopcroft–Karp algorithm: Difference between revisions

Revision as of 05:47, 13 July 2006

Revision as of 19:03, 29 August 2006

Line 1:

The '''Hopcroft-Karp algorithm''' finds maximum cardinality [[matching]]s in [[bipartite graph]]s in <math>O(\sqrt{V} E)</math> time.

== Algorithm ==

Line 13:

== References ==

* {{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 02620329370-262-03293-7}}

[[Category:Graphs]]

{{comp-sci-stub}}