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: | Ferisar Kagis |

Country: | Burkina Faso |

Language: | English (Spanish) |

Genre: | Marketing |

Published (Last): | 21 January 2008 |

Pages: | 353 |

PDF File Size: | 12.52 Mb |

ePub File Size: | 17.90 Mb |

ISBN: | 994-2-85489-637-3 |

Downloads: | 55493 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Gotilar |

Contents Chapter 1 Matchings in pulmmer graphs. Chapter 1 Matchings in bipartite graphs. Vazirani Limited preview – Print Price 2 Label: Email, fax, or send via postal mail to:. Chapter 6 Some graphtheoretical problems related to matchings.

Libraries and resellers, please contact cust-serv ams. Account Options Sign matdhing. References to this book Approximation Algorithms Vijay V. 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.

### AMS :: Lovasz and Plummer: Matching Theory

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. Chapter 8 Determinants and matchings. 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 1 Label: Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.

Online Price 2 Label: Online Price 3 Label: My library Help Advanced Book Search. Chapter 12 Vertex packing and covering.

## Additional Material for the Book

Publication Month and Year: Chapter 10 The ffactor problem. Chapter 11 Matroid matching. Print Price 1 Label: Further discussed are 2-matchings, general matching problems as linear programs, the Readership Graduate students and research mathematicians interested in graph theory, combinatorics, macthing optimization, or graph algorithms.

Complete and sign the license agreement. Access Online via Elsevier Amazon. This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. 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.

See our librarian page for additional eBook ordering options. Chapter 9 Matching algorithms.

This tbeory 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. Plummer No preview available – The logasz 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. ElsevierJun 1, – Mathematics – pages.

Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm and other algorithmic approachesf-factors and vertex packing.

## Matching Theory

Author s Product display: Selected pages Page ix. It goes on to study elementary bipartite graphs and elementary graphs in general. Chapter 2 Flow theory. Browse the current eBook Collections price list. Online Price 1 Label: An Imprint of the American Mathematical Society. Approximation Algorithms Vijay V. Chapter 4 Bipartite graphs with perfect matchings.

To subscribe to the current year of Memoirs of plummr AMSplease download this required license agreement. Matching Theory Share this page.