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.
| Author: | Dizil Arakinos |
| Country: | Sierra Leone |
| Language: | English (Spanish) |
| Genre: | Literature |
| Published (Last): | 4 May 2004 |
| Pages: | 391 |
| PDF File Size: | 11.29 Mb |
| ePub File Size: | 14.46 Mb |
| ISBN: | 596-4-86434-646-4 |
| Downloads: | 99658 |
| Price: | Free* [*Free Regsitration Required] |
| Uploader: | Meztigis |
Matching Theory – László Lovász, M. D. Plummer – Google Books
Chapter 2 Flow theory. Email, fax, or send via postal mail to:. Author s Product display: It goes on to study elementary bipartite graphs and elementary graphs in general. An Imprint of the American Mathematical Society. Contents Chapter 1 Matchings in bipartite graphs. Account Options Sign in. Print Price 2 Label: Approximation Algorithms Vijay V. Chapter 10 The ffactor problem.
Additional Material for the Book
ElsevierJun 1, – Mathematics – pages. Chapter 11 Matroid matching. For AMS eBook frontlist subscriptions or backfile collection purchases: Email, fax, or send via postal mail to: Plummer Limited preview – Matching Theory Share this page. Online Price 1 Label: 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.
Dual Price 2 Label: Online Price 2 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. Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.
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. Chapter 12 Vertex packing and covering.
Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm and other algorithmic approachesf-factors and vertex packing. Access Online via Elsevier Amazon. Join our email list.
Chapter 1 Matchings in bipartite graphs. Loavsz study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. Vazirani Limited preview – Chapter 5 General graphs with perfect matchings. Readership Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms. Chapter 4 Bipartite graphs with perfect matchings. Chapter 3 Size and structure of maximum matchings.
Chapter 6 Some graphtheoretical problems related to matchings. Dual Price 1 Label: Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms. Chapter 7 Matching and linear programming. Complete and sign the license agreement. 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.