Computing edge-connectivity augmentation function in Õ(nm) time

Authors:
Hiroshi Nagamochi;Takashi Shiraki;Toshihide Ibaraki
Affiliations:
Kyoto University, Kyoto, Japan 606-01;Kyoto University, Kyoto, Japan 606-01;Kyoto University, Kyoto, Japan 606-01
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

Edge-connectivity augmentation problems

Journal of Computer and System Sciences
Applications of a poset representation to edge connectivity and graph rigidity

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
On sparse subgraphs preserving connectivity properties

Journal of Graph Theory
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
Deterministic Õ(nm) time edge-splitting in undirected graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Simple Min Cut Algorithm

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms

Max-stretch reduction for tree spanners

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Hi-index	0.00