# 8.29

Revision as of 14:12, 21 September 2020 by Algowikiadmin (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...")

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.

Back to Chapter 8