Matchings and Extensions
Author:
- W.R. PulleyblankWPW.R. Pulleyblank
- 1 January 1995
- book chapter
- Published by Elsevier
- p. 179-232
Abstract
No abstract availableThis publication has 64 references indexed in Scilit:
- A theory of alternating paths and blossoms for proving correctness of the $O(\sqrt V E)$ general graph maximum matching algorithmCombinatorica, 1994
- Conservative weightings and ear-decompositions of graphsCombinatorica, 1993
- Algorithms for Degree Constrained Graph Factors of Minimum DeficiencyJournal of Algorithms, 1993
- Reductions to 1–matching polyhedraNetworks, 1983
- Rank of maximum matchings in a graphMathematical Programming, 1982
- A 1‐matching blossom‐type algorithm for edge covering problemsNetworks, 1982
- An efficient algorithm for minimumk-covers in weighted graphsMathematical Programming, 1975
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Über Graphen und ihre Anwendung auf Determinantentheorie und MengenlehreMathematische Annalen, 1916