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

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.

[1]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[2]  H. H. Westermann.  Efficient algorithms for matroid sums , 1988 .

[3]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[4]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[5]  Dan Gusfield,et al.  Connectivity and Edge-Disjoint Spanning Trees , 1983, Information Processing Letters.

[6]  Brigitte Servatius,et al.  Birigidity in the Plane , 1989, SIAM J. Discret. Math..

[7]  Robert E. Tarjan,et al.  Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.

[8]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[9]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[10]  Y. Kajitani,et al.  Maximally Distant Trees and Principal Partition of a Linear Graph , 1969 .

[11]  H. Watanabe,et al.  Topological degrees of freedom and mixed analysis of electrical networks , 1970 .

[12]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[13]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[14]  Tiong-Seng Tay,et al.  Rigidity of multi-graphs. I. Linking rigid bodies in n-space , 1984, J. Comb. Theory, Ser. B.

[15]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[16]  L. Weinberg,et al.  A constructive graph-theoretic solution of the Shannon switching game , 1970 .

[17]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[18]  A. Recski.  Matroid theory and its applications in electric network theory and in statics , 1989 .

[19]  Maurice Queyranne,et al.  A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory , 1982, Networks.

[20]  Walter Whiteley,et al.  The Union of Matroids and the Rigidity of Frameworks , 1988, SIAM J. Discret. Math..

[21]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[22]  Matthias F. Stallmann,et al.  Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) , 1985, ICALP.

[23]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[24]  Robert E. Tarjan,et al.  Almost-optimum speed-ups of algorithms for bipartite matching and related problems , 1988, STOC '88.

[25]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest , 1988, Inf. Process. Lett..

[26]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[27]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[28]  Louis Weinberg,et al.  The principal minors of a matroid , 1971 .

[29]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[30]  Walter Whiteley,et al.  The algebraic geometry of motions of bar-and-body frameworks , 1987 .

[31]  Robert E. Tarjan,et al.  A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees , 1985, Math. Oper. Res..

[32]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[33]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[34]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[35]  Jack Edmonds,et al.  Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

[36]  H. Imai.  NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS , 1983 .

[37]  M. Iri,et al.  Use of matroid theory in operations research, circuits and systems theory , 1981 .

[38]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.