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.
Buy this ebook and get 1 more FREE!
Language English ● Format PDF ● ISBN 9780080872322 ● Publisher Elsevier Science ● Published 1986 ● Downloadable 6 times ● Currency EUR ● ID 2265125 ● Copy protection Adobe DRM
Requires a DRM capable ebook reader