jo-cerdeira

Citation:

Cerdeira, Orestes} {J. "Matroids and a forest cover problem." Mathematical Programming. 66 (1994): 403-405.

Abstract:

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.

Notes:

n/a