# 8.29

Jump to navigation
Jump to 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.

Back to Chapter 8