Modification of Edmonds' maximum matching algorithm

DOI10.6028/JRES.069B.009MaRDI QIDQ5516088zbMATH OpenFDO

Authors Christoph Witzgall, C. T. Zahn

Publication date 1965

Published in Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.6028/JRES.069B.009

zbMATH Keywords

topology

Cited in

(9)

• Matching theory -- a sampler: From Dénes König to the present
• A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
• Maximum internally stable sets of a graph
• Heuristically guided search and chromosome matching
• Establishing the matching polytope
• Linear-time approximation for maximum weight matching
• Una variante del algoritmo de Edmonds para acoplamientos Maximos
• Frutex y caminos nodales
• A 1-matching blossom-type algorithm for edge covering problems

This page was built for publication: Modification of Edmonds' maximum matching algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5516088)