Matroids and a forest cover problem
JO Cerdeira - Mathematical programming, 1994 - Springer
Mathematical programming, 1994•Springer
A forest cover of a graph is a spanning forest for which each component has at least two
nodes. If K is a subset of nodes, a K-forest cover is a forest cover including exactly one node
from K in each component. We show that the weighted two matroid intersection algorithm
determines the maximum cost K-forest cover.
nodes. If K is a subset of nodes, a K-forest cover is a forest cover including exactly one node
from K in each component. We show that the weighted two matroid intersection algorithm
determines the maximum cost K-forest cover.
Abstract
A forest cover of a graph is a spanning forest for which each component has at least two nodes. IfK is a subset of nodes, aK-forest cover is a forest cover including exactly one node fromK in each component. We show that the weighted two matroid intersection algorithm determines the maximum costK-forest cover.
Springer
Showing the best result for this search. See all results