Matching theory [electronic resource] / by L. Lov�asz and M.D. Plummer.

By: Lov�asz, L�aszl�o, 1948-Contributor(s): Plummer, M. DMaterial type: Text

TextSeries: North-Holland mathematics studies ; 121. | Annals of discrete mathematics ; 29.Publication details: Amsterdam ; New York : New York, N.Y. : North-Holland : Elsevier Science Publishers B.V. ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1986. Description: 1 online resource (xxxiii, 544 p.) : illISBN: 9780444879165; 0444879161Subject(s): Matching theory | Couplage, Th�eorie du | Matching | Numerieke wiskunde | Matching theoryGenre/Form: Electronic books.Additional physical formats: Print version:: Matching theory.DDC classification: 511/.6 LOC classification: QA164 | .L7 1986ebOnline resources: ScienceDirect | Volltext

Contents:

1. Matching in Bipartite Graphs. 2. Flow Theory. 3. Size and Structure of Maximum Matchings. 4. Bipartite Graphs with Perfect Matchings. 5. General Graphs with Perfect Matchings. 6. Some Graph-Theoretical Problems Related to Matchings. 7. Matching and Linear Programming. 8. Determinants and Matchings. 9. Matching Algorithms. 10. The f-Factor Problem. 11. Matroid Matching. 12. Vertex Packing and Covering. References. Indices.

Summary: This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 5 )
Comments ( 0 )

No physical items for this record

This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.