Cargando…
Matching theory
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,...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
North-Holland
1986
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/1990784 |
| Sumario: | 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. |
|---|