Hopcroft–Karp algorithm: Difference between revisions

Content deleted Content added
Kyle the bot (talk | contribs)
Line 1:
The '''Hopcroft-KarpHopcroft–Karp algorithm''' finds maximum cardinality [[matching]]s in [[bipartite graph]]s in <math>O(\sqrt{V} E)</math> time.
 
== Algorithm ==