Matching theory /
Saved in:
| Author / Creator: | Lovász, László, 1948- |
|---|---|
| Imprint: | Amsterdam ; New York : North-Holland : Elsevier Science Publishers B.V. ; New York, N.Y. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1986. |
| Description: | xxxiii, 544 p. : ill. ; 24 cm. |
| Language: | English |
| Series: | North-Holland mathematics studies 121 Annals of discrete mathematics 29 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/811168 |
| 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. |
|---|---|
| Item Description: | Includes indexes. |
| Physical Description: | xxxiii, 544 p. : ill. ; 24 cm. |
| Bibliography: | Bibliography: p. [483]-526. |
| ISBN: | 0444879161 |