Matching Theory ( Volume 29 )

Publication series :Volume 29

Author: Plummer   M. D.;Lovász   L.  

Publisher: Elsevier Science‎

Publication year: 1986

E-ISBN: 9780080872322

P-ISBN(Paperback): 9780444879165

P-ISBN(Hardback):  9780444879165

Subject: O157.1 portfolio analysis

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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.

Chapter

Front Cover

pp.:  1 – 4

Matching Theory

pp.:  4 – 5

Copyright Page

pp.:  5 – 6

Table of Contents

pp.:  6 – 12

Preface

pp.:  12 – 34

Basic Terminology

pp.:  34 – 40

Chapter 1. Matchings in bipartite graphs

pp.:  40 – 80

Chapter 2. Flow theory

pp.:  80 – 122

Chapter 3. Size and structure of maximum matchings

pp.:  122 – 160

Chapter 4. Bipartite graphs with perfect matchings

pp.:  160 – 182

Chapter 5. General graphs with perfect matchings

pp.:  182 – 252

Chapter 6. Some graph-theoretical problems related to matchings

pp.:  252 – 294

Chapter 7. Matching and linear programming

pp.:  294 – 346

Chapter 8. Determinants and matchings

pp.:  346 – 396

Chapter 9. Matching algorithms

pp.:  396 – 422

Chapter 10. The f-factor problem

pp.:  422 – 448

Chapter 11. Matroid matching

pp.:  448 – 482

Chapter 12. Vertex packing and covering

pp.:  482 – 522

References

pp.:  522 – 566

Index of Terms

pp.:  566 – 578

Index of Symbols

pp.:  578 – 584

The users who browse this book also browse