Abstract
We introduce the concept of matching forests as a generalization of branchings in a directed graph and matchings in an undirected graph. Given special weights on the edges of a mixed graph, we present an efficient algorithm for finding an optimum weight-sum matching forest. The algorithm is a careful application of known branching and matching algorithms. The maximum cardinality matching forest problem is solved as a special case.
Similar content being viewed by others
References
C. Berge,Graphs and hypergraphs (North-Holland, Amsterdam, 1973).
J. Edmonds, “Paths, trees and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.
J. Edmonds, “Maximum matching and a polyhedron with (0, 1) vertices”,Journal of Research of the National Bureau of Standards 69B (1965) 125–130.
J. Edmonds, “An introduction to matching”, Lecture Notes, University of Michigan Summer Engineering Conference (1967).
J. Edmonds, “Optimum branchings”,Journal of Research of the National Bureau of Standards 71B (1967) 233–240.
J. Edmonds and E.L. Johnson, “Matching: A well-solved class of integer linear programs”, in: R.K. Guy et al., eds,Combinatorial structures and their applications (Gordon and Breach; New York, 1970).
J. Edmonds and W.R. Pulleyblank,Optimum matching (John Hopkins Press, to appear).
H.N. Gabow, “An efficient implementation of Edmonds' algorithm for maximum matchings on graphs”,Journal of the Association of Computing Machinery 23 (1976) 221–234.
R. Giles, “Optimum matching forests II: General weights”,Mathematical Programming 22 (1982) 12–38.
E.L. Lawler,Combinatorial optimization: Networks and matroids (Holt, Rinehart and Winston, New York, 1976).
W.R. Pulleyblank,Faces of matching polyhedra, Thesis, University of Waterloo, Canada (1973).
R.E. Tarjan, “Depth first search and linear graph algorithms”,SIAM Journal on Computing 1 (1972) 146–160.
R.E. Tarjan, “Finding optimum branchings”,Networks 7 (1977) 25–35.
Author information
Authors and Affiliations
Additional information
Research partially supported by a N.R.C. of Canada Postdoctorate Fellowship.
Rights and permissions
About this article
Cite this article
Giles, R. Optimum matching forests I: Special weights. Mathematical Programming 22, 1–11 (1982). https://doi.org/10.1007/BF01581022
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581022