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. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Al-Jubeh, M., Ishaque, M., Rédei, K., Souvaine, D. L., & Tóth, C. D. (2009). Tri-edge-connectivity augmentation for planar straight line graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 902–912). https://doi.org/10.1007/978-3-642-10631-6_91
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
