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.

Matching Theory (North-Holland Mathematics Studies 121) (Volume 29)

Science & Math

L. Lovász

M. D. Plummer

Mathematics

North-Holland

See the best price to sell, buy, or rent books by M. D. Plummer. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by M. D. Plummer

See the best price to sell, buy, or rent books by M. D. Plummer. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Matching Theory (North-Holland Mathematics Studies 121) (Volume 29)