Classical bipartite cardinality matching

From Algowiki

Revision as of 13:41, 17 November 2014 by Weihe (talk | contribs) (→‎Abstract view)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Abstract view

Algorithmic problem: Cardinality-maximal matching in bipartite graphs.

Type of algorithm: loop.

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Classical_bipartite_cardinality_matching&oldid=2159"