Séminaire Lotharingien de Combinatoire, B15p (1986), 4 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-15, p.
97-100.]
Ursula Rütsch
Optimale Matching Forests
Abstract.
We treat a generalization of the branching- and matching-problems:
the matching forest problem. This means to consider a mixed graph
and search, under certain target goals, a subset of the edges
of the graph such that these edges do not contain a cycle and
such that each vertex is on at most one edge.
The following version is available: