Forests, frames, and games: Algorithms for matroid sums and applications
- Cite this article as:
- Gabow, H.N. & Westermann, H.H. Algorithmica (1992) 7: 465. doi:10.1007/BF01758774
This paper presents improved algorithms for matroid-partitioning problems, such as finding a maximum cardinality set of edges of a graph that can be partitioned intok forests, and finding as many disjoint spanning trees as possible. The notion of a clump in a matroid sum is introduced, and efficient algorithms for clumps are presented. Applications of these algorithms are given to problems arising in the study of the structural rigidity of graphs, the Shannon switching game, and others.