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.
Rezensionen / Stimmen
It begins at an elementary level and ends at the frontiers of current research, and the journey is enlivened by readable exposition, helpful motivation, interesting historical background and elegant proofs... a truly notable achievement...Bulletin of the London Mathematical SocietyEverything is developed with splendid clarity, organized in a masterful way and written in an excellent style, sometimes exciting, sometimes humorous, always maintaining a lively dialogue with the reader. This beautiful book provides a comprehensive treatment of the subject, leading up to the frontiers of current research.Optima
Reihe
Sprache
Verlagsort
Verlagsgruppe
Elsevier Science & Technology
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
ISBN-13
978-0-444-87916-5 (9780444879165)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Autor*in
Princeton University, Department of Computer Science, USA
1. Matching in Bipartite Graphs. 2. Flow Theory. 3. Size and Structure of Maximum Matchings. 4. Bipartite Graphs with Perfect Matchings. 5. General Graphs with Perfect Matchings. 6. Some Graph-Theoretical Problems Related to Matchings. 7. Matching and Linear Programming. 8. Determinants and Matchings. 9. Matching Algorithms. 10. The f-Factor Problem. 11. Matroid Matching. 12. Vertex Packing and Covering. References. Indices.
