Find out how to access previewonly content
, Volume 7, Issue 1, pp 465497
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 AccessAbstract
This paper presents improved algorithms for matroidpartitioning 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 Barandjoint framework Barandbody framework Rigidity Shannon switching game Title
 Forests, frames, and games: Algorithms for matroid sums and applications
 Journal

Algorithmica
Volume 7, Issue 16 , pp 465497
 Cover Date
 199206
 DOI
 10.1007/BF01758774
 Print ISSN
 01784617
 Online ISSN
 14320541
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Matroid
 Matroid sum
 Matroid partitioning
 Covering
 Arboricity
 Packing
 Barandjoint framework
 Barandbody framework
 Rigidity
 Shannon switching game
 Industry Sectors
 Authors

 Harold N. Gabow ^{(1)}
 Herbert H. Westermann ^{(2)}
 Author Affiliations

 1. Department of Computer Science, University of Colorado at Boulder, 80309, Boulder, CO, USA
 2. Department 3228, IBM Laboratories, Schönaidner Strasse 220, 7030, Böblingen, Germany