Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computing edge-connectivity augmentation function in Õ(nm) time
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A near-linear time algorithm for constructing a cactus representation of minimum cuts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Augmenting the edge-connectivity of a spider tree
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Edge-Connectivity augmentation and network matrices
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
An overview of algorithms for network survivability
ISRN Communications and Networking
Finding dominators via disjoint set union
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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.