Matching Theory, Issue 121

Front Cover
North-Holland, Jan 1, 1986 - Mathematics - 544 pages
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.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

Bibliographic information