Talk:TADM2E 6.25

From Algorithm Wiki

Revision as of 08:59, 2 December 2019 by Nitely (talk | contribs) (Created page with "1. Find maximum matching. Bipartite matching is described in the book. General matching would require Edmonds Blossom algorithm. 2. Include an arbitrary edge for every uncover...")

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

Jump to: navigation, search

1. Find maximum matching. Bipartite matching is described in the book. General matching would require Edmonds Blossom algorithm. 2. Include an arbitrary edge for every uncovered vertex. A greedy algorithm suffices.

Retrieved from "https://algorist.com/algowiki_v2/index.php?title=Talk:TADM2E_6.25&oldid=718"