, Volume 7, Issue 1, pp 465-497

First online:

Forests, frames, and games: Algorithms for matroid sums and applications

  • Harold N. GabowAffiliated withDepartment of Computer Science, University of Colorado at Boulder
  • , Herbert H. WestermannAffiliated withDepartment 3228, IBM Laboratories

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Key words

Matroid Matroid sum Matroid partitioning Covering Arboricity Packing Bar-and-joint framework Bar-and-body framework Rigidity Shannon switching game