This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.
- ISBN10 1281788449
- ISBN13 9781281788443
- Publish Date 1 January 1986
- Publish Status Active
- Out of Print 17 June 2015
- Publish Country US
- Imprint North-Holland
- Format eBook
- Pages 544
- Language English