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):||21 June 2012|
|PDF File Size:||5.17 Mb|
|ePub File Size:||9.52 Mb|
|Price:||Free* [*Free Regsitration Required]|
Approximation Algorithms Vijay V. Chapter 3 Size and structure of maximum matchings. Print Price 2 Label: Matching Theory Share this page.
AMS eBooks: AMS Chelsea Publishing
tgeory 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.
Selected pages Page ix. Chapter 8 Determinants and matchings. Email, fax, or send via postal mail to:.
Additional Material for the Book
Browse the current eBook Collections price list. Ordering on the AMS Bookstore is limited to individuals for personal use only.
ElsevierJun 1, – Mathematics – pages. Libraries and resellers, please contact cust-serv ams. Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.
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. References to this book Approximation Algorithms Vijay V.
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. Join our email list.
My library Help Advanced Book Search. Vazirani Limited preview – See our librarian page for additional eBook ordering options. Complete and sign the license agreement. Chapter 4 Bipartite graphs with perfect matchings. Author s Product display: Plummer Snippet view – Chapter 9 Matching algorithms. Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.
To subscribe to the current year of Memoirs of the AMSplease download this required license agreement. It goes on to study elementary bipartite graphs and elementary graphs in general. Online Price 1 Label: Online Price 2 Label: Dual Price 2 Label: Chapter 11 Matroid matching. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm and other algorithmic approachesf-factors and vertex packing.
Publication Month and Year: Further discussed are 2-matchings, general matching problems as linear programs, the Chapter 7 Matching and linear programming. Readership Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms. Print Price 1 Label: 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.
Plummer No preview available –