Edge-connectivity augmentation with partition constraints

Authors:
Jørgen Bang-Jensen;Harold N. Gabow;Tibor Jordán;Zoltán Szigeti
Affiliations:
Department of Mathematics and Computer Science, Odense University, Campusvej 55, DK-5230 Odense, Denmark;Department of Computer Science, University of Colorado at Boulder, Boulder, Colorado;Department of Mathematics and Computer Science, Odense University, Campusvej 55, DK-5230 Odense, Denmark;Equipe Combinatoire, Universite Paris VI, 4, place Jussieu, 75252 Paris, France
Venue:
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Year:
1998

Edge-connectivity augmentation problems

Journal of Computer and System Sciences
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
Deterministic Õ(nm) time edge-splitting in undirected graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Fast Algorithm for Optimally Increasing the Edge Connectivity

SIAM Journal on Computing
Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract)

ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Edge-Connectivity Augmentation Preserving Simplicity

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Two NP-Complete Augmentation Problems

Two NP-Complete Augmentation Problems
Edge-Connectivity Augmentation with Partition Constraints

Edge-Connectivity Augmentation with Partition Constraints

How to make a square grid framework with cables rigid

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Edge-Splitting Problems with Demands

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Applications of combinatorics to statics: rigidity of grids

Discrete Applied Mathematics

Hi-index	0.00