https://algorist.com//algowiki/index.php?title=8.29&feed=atom&action=history8.29 - Revision history2024-03-29T14:05:15ZRevision history for this page on the wikiMediaWiki 1.34.2https://algorist.com//algowiki/index.php?title=8.29&diff=432&oldid=prevAlgowikiadmin: 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..."2020-09-21T14:12:28Z<p>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..."</p>
<p><b>New page</b></p><div>1. Find maximum matching. Bipartite matching is described in the book. General matching would require Edmonds Blossom algorithm.<br />
2. Include an arbitrary edge for every uncovered vertex. A greedy algorithm suffices.<br />
<br />
<br />
Back to [[Chapter 8]]</div>Algowikiadmin