Difference between revisions of "8.29"

From The Algorithm Design Manual Solution Wiki
Jump to navigation Jump to search
(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...")
 
(No difference)

Latest revision as of 14:12, 21 September 2020

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