Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs

Authors:
Marwan Al-Jubeh;Mashhood Ishaque;Kristóf Rédei;Diane L. Souvaine;Csaba D. Tóth
Affiliations:
Department of Computer Science, Tufts University, Medford, USA;Department of Computer Science, Tufts University, Medford, USA;Department of Computer Science, Tufts University, Medford, USA;Department of Computer Science, Tufts University, Medford, USA;Department of Computer Science, Tufts University, Medford, USA and Department of Mathematics, University of Calgary, Canada
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 7
Cited 2

Edge-connectivity augmentation problems

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

SIAM Journal on Discrete Mathematics
Augmenting edge-connectivity over the entire range in Õ(nm) time

Journal of Algorithms
Graph connectivity and its augmentation: applications of MA orderings

Discrete Applied Mathematics
Independence free graphs and vertex connectivity augmentation

Journal of Combinatorial Theory Series B
Augmenting the connectivity of geometric graphs

Computational Geometry: Theory and Applications
A vertex-face assignment for plane graphs

Computational Geometry: Theory and Applications

Planar subgraphs without low-degree nodes

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximating the edge length of 2-edge connected planar geometric graphs on a set of points

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that if a planar straight line graph (Pslg) with n vertices in general position in the plane can be augmented to a 3-edge-connected Pslg, then 2n 驴 2 new edges are enough for the augmentation. This bound is tight: there are Pslgs with n 驴 4 vertices such that any augmentation to a 3-edge-connected Pslg requires 2n 驴 2 new edges.