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.
Köp den här e-boken och få 1 till GRATIS!
Språk Engelska ● Formatera PDF ● ISBN 9780080872322 ● Utgivare Elsevier Science ● Publicerad 1986 ● Nedladdningsbara 6 gånger ● Valuta EUR ● ID 2265125 ● Kopieringsskydd Adobe DRM
Kräver en DRM-kapabel e-läsare