Algorithmica

, 7:465

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

Authors

  • Harold N. Gabow
    • Department of Computer ScienceUniversity of Colorado at Boulder
  • Herbert H. Westermann
    • Department 3228IBM Laboratories
Article

DOI: 10.1007/BF01758774

Cite this article as:
Gabow, H.N. & Westermann, H.H. Algorithmica (1992) 7: 465. doi:10.1007/BF01758774

Abstract

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

MatroidMatroid sumMatroid partitioningCoveringArboricityPackingBar-and-joint frameworkBar-and-body frameworkRigidityShannon switching game

Copyright information

© Springer-Verlag New York Inc. 1992