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,...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Otros Autores: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
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.
|
Colección: | North-Holland mathematics studies ;
121. Annals of discrete mathematics ; 29. |
Temas: | |
Acceso en línea: | Texto completo Texto completo Texto completo |
Tabla de Contenidos:
- 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.