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):||18 February 2011|
|PDF File Size:||8.97 Mb|
|ePub File Size:||6.40 Mb|
|Price:||Free* [*Free Regsitration Required]|
Complete and sign the license agreement.
Additional Material for the Book
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.
Email, fax, or send via postal mail to: My library Help Advanced Book Search. Plummer No preview available – Dual Price 2 Label: Email, fax, or send via postal mail to:. Contents Chapter 1 Matchings in bipartite graphs.
AMS :: Lovasz and Plummer: Matching Theory
Online Price 2 Label: ElsevierJun 1, – Mathematics – pages. Matching Theory Share this page. Chapter 9 Matching algorithms. Dual Price 1 Label: Author s Product display: Print Price 1 Label: This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case.
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 Snippet view – Account Options Sign in. Print Price 3 Label: Ordering on the AMS Bookstore is limited to individuals for personal use only.
Chapter 6 Some graphtheoretical problems related to matchings. Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms. Chapter 4 Bipartite graphs with perfect matchings.
It goes on to study elementary bipartite graphs and elementary graphs in general. Online Price 1 Label: Chapter 1 Matchings in bipartite graphs. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm and other algorithmic approachesf-factors matcihng vertex packing. Browse the current eBook Collections price list. This book surveys matching theory, with pllummer 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.
Online Price 3 Label: Chapter 2 Flow theory.
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.
Further discussed are 2-matchings, general matching problems as linear programs, the Chapter 12 Vertex packing and covering. Chapter 7 Matching and linear programming. Selected pages Page ix. Join our email list. Approximation Algorithms Vijay V.