Applications of a poset representation to edge connectivity and graph rigidity

A poset representation for a family of sets defined by a labeling algorithm is investigated. Poset representations are given for the family of minimum cuts of a graph, and it is shown how to compute them quickly. The representations are the starting point for algorithms that increase the edge connectivity of a graph, from lambda to a given target tau = lambda + delta , adding the fewest edges possible. For undirected graphs the time bound is essentially the best-known bound to test tau -edge connectivity; for directed graphs the time bound is roughly a factor delta more. Also constructed are poset representations for the family of rigid subgraphs of a graph, when graphs model structures constructed from rigid bars. The link between these problems is that they all deal with graphic matroids.<<ETX>>

[1]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..

[2]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[3]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

[5]  E. A. Timofeev,et al.  Efficient algorithm for finding all minimal edge cuts of a nonoriented graph , 1986 .

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

[7]  András Frank,et al.  Augmenting graphs to meet edge-connectivity requirements , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Charles U. Martel,et al.  A fast algorithm for optimally increasing the edge-connectivity , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[10]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[11]  Harold N. Gabow.  A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[12]  Masataka Nakamura.  ON THE REPRESENTATION OF THE RIGID SUB-SYSTEMS OF A PLANE LINK SYSTEM , 1986 .

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

[14]  Harold N. Gabow,et al.  Forests, frames, and games: algorithms for matroid sums and applications , 1988, STOC '88.