Matching Theory

Front Cover
Elsevier, Jun 1, 1986 - Mathematics - 543 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.

Contents

Chapter 1 Matchings in bipartite graphs
1
Chapter 2 Flow theory
41
Chapter 3 Size and structure of maximum matchings
83
Chapter 4 Bipartite graphs with perfect matchings
121
Chapter 5 General graphs with perfect matchings
143
Chapter 6 Some graphtheoretical problems related to matchings
213
Chapter 7 Matching and linear programming
255
Chapter 8 Determinants and matchings
307
Chapter 9 Matching algorithms
357
Chapter 10 The ffactor problem
383
Chapter 11 Matroid matching
409
Chapter 12 Vertex packing and covering
443
References
483
Index of Terms
527
Index of Symbols
539
Copyright

Other editions - View all

Common terms and phrases

About the author (1986)

Jonathan Plummer is Terry McMillan's ex-husband."Balancing Act" is his first novel.

Bibliographic information