Matching theory [E-Book] / by L. Lovasz and M.D. Plummer.
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,...
Saved in:
Full text |
|
Personal Name(s): | Lovasz, Laszlo, |
Plummer, M. D. | |
Imprint: |
Amsterdam ; New York : New York, N.Y. :
North-Holland :
1986
Elsevier Science Publishers B.V. ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., |
Physical Description: |
1 online resource (xxxiii, 544 p.) : ill. |
Note: |
englisch |
ISBN: |
9780444879165 0444879161 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
North-Holland mathematics studies ;
121 /* Depending on the record driver, $field may either be an array with "name" and "number" keys or a flat string containing only the series name. We should account for both cases to maximize compatibility. */?> Annals of discrete mathematics ; 29 |
Subject (LOC): |
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. |