Advertisement

Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity

  • Hugo Alves Akitaya
  • Jonathan Castello
  • Yauheniya Lahoda
  • Anika Rounds
  • Csaba D. Tóth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)

Abstract

We show that every planar straight line graph (PSLG) with n vertices can be augmented to a 2-edge-connected PSLG with the addition of at most \(\lfloor (4n-4)/3\rfloor \) new edges. This bound is the best possible.

References

  1. 1.
    Abellanas, M., García, A., Hurtado, F., Tejel, J., Urrutia, J.: Augmenting the connectivity of geometric graphs. Comput. Geom. 40(3), 220–230 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Bose, P., Houle, M.E., Toussaint, G.T.: Every set of disjoint line segments admits a binary tree. Discrete Comput. Geom. 26, 387–410 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Tóth, C.D.: Connectivity augmentation in planar straight line graphs. European J. Combin. 33(3), 408–425 (2012)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Hugo Alves Akitaya
    • 1
  • Jonathan Castello
    • 2
  • Yauheniya Lahoda
    • 2
  • Anika Rounds
    • 1
  • Csaba D. Tóth
    • 1
    • 2
  1. 1.Tufts UniversityMedfordUSA
  2. 2.California State University NorthridgeLos AngelesUSA

Personalised recommendations