Matroids and a forest cover problem

Matroids and a forest cover problem

0.00 Avg rating—0 Votes
Article ID: iaor19961324
Country: Netherlands
Volume: 66
Issue: 3
Start Page Number: 403
End Page Number: 405
Publication Date: Sep 1994
Journal: Mathematical Programming (Series A)
Authors:
Keywords: matroids
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. The paper shows that the weighted two matroid intersection algorithm determines the maximum cost K-forest cover.

Reviews

Required fields are marked *. Your email address will not be published.