MATCHING THEORY by. L. LOVÁSZ. Department of. Computer Science,. Eötvös University. Budapest. Hungary and. M.D. PLUMMER. Department of. : Matching Theory (AMS Chelsea Publishing) (): Laszlo Lovasz, Michael D. Plummer: Books. Matching Theory László Lovász and Michael D. Plummer Publication Year: ISBN ISBN AMS Chelsea.
|Published (Last):||2 December 2005|
|PDF File Size:||11.15 Mb|
|ePub File Size:||2.93 Mb|
|Price:||Free* [*Free Regsitration Required]|
See our librarian page for additional eBook ordering options. It goes on to study elementary bipartite graphs and elementary graphs in general. Dual Price 1 Label: Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms. Print Price 3 Theroy Libraries and resellers, please contact cust-serv ams. Chapter 8 Determinants and matchings.
Matching Theory – László Lovász, M. D. Plummer – Google Books
An Imprint of the American Mathematical Society. Chapter 7 Matching and linear programming. This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics.
Plimmer Chapter 1 Matchings in bipartite graphs. Join our email list. Chapter 3 Size and structure of maximum matchings. tyeory
Complete and sign the license agreement. Account Options Sign in. Chapter 10 The ffactor problem.
Online Price 3 Label: Publication Month and Year: Ordering on the AMS Bookstore is limited to individuals for personal use only. Chapter 5 General graphs with perfect matchings.
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case.
AMS eBooks: AMS Chelsea Publishing
References to this book Approximation Algorithms Vijay V. To subscribe to the current year of Memoirs of the AMSplease download this required license agreement. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first published inby launching among other things the Markov Chain Monte Carlo method.
Chapter 11 Matroid matching.
Author s Product display: Chapter 1 Matchings in bipartite graphs. Plummer Snippet view – Approximation Algorithms Vijay V. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm and other algorithmic approachesf-factors and vertex packing.
Readership Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.
Chapter 2 Flow theory. Matching Theory Share this page. Email, fax, or send via postal mail to:.
Additional Material for the Book
Plummer No preview available – Browse the current eBook Collections price list. Dual Price 2 Label: Access Online via Elsevier Amazon. Further discussed are 2-matchings, general matching problems as linear programs, the Besides basic results on the existence of matchings and on plmmer matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics.
For AMS eBook frontlist subscriptions or backfile collection purchases: Selected plummsr Page ix.