Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three

Authors:
Marwan Al-Jubeh;Mashhood Ishaque;Kristóf Rédei;Diane L. Souvaine;Csaba D. Tóth;Pavel Valtr
Affiliations:
Tufts University, Department of Computer Science, Medford, MA, USA;Tufts University, Department of Computer Science, Medford, MA, USA;Tufts University, Department of Computer Science, Medford, MA, USA;Tufts University, Department of Computer Science, Medford, MA, USA;University of Calgary, Department of Mathematics, Calgary, AB, Canada;Charles University, Department of Applied Mathematics and Institute for Theoretical Computer Science, Prague, Czech Republic
Venue:
Algorithmica
Year:
2011

Citing 0
Cited 2

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
Compatible spanning trees

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize the planar straight line graphs (Pslgs) that can be augmented to 3-connected and 3-edge-connected Pslgs, respectively. We show that if a Pslg with n vertices can be augmented to a 3-edge-connected Pslg, then at most 2n−2 new edges are always sufficient and sometimes necessary for the augmentation. If the input Pslg is, in addition, already 2-edge-connected, then n−2 new edges are always sufficient and sometimes necessary for the augmentation to a 3-edge-connected Pslg.