Skip to main content
SpringerLink
Log in

Augmenting the Connectivity of Outerplanar Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We provide an optimal algorithm for the problem of augmenting an outerplanar graph G by adding a minimum number of edges in such a way that the augmented graph G′ is outerplanar and 2-connected. We also solve optimally the same problem when instead we require G′ to be 2-edge-connected.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  2. Bollobás, B.: Modern Graph Theory. Springer, New York (1998)

    MATH  Google Scholar 

  3. Cheng, E., Jordán, T.: Successive edge-connectivity augmentation problems. Math. Program. 84, 577–593 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5, 653–665 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  5. García, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.: Packing trees into planar graphs. J. Graph Theory 40, 172–181 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hsu, T.S.: On four-connecting a triconnected graph. In: Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 70–79 (1992)

  7. Jackson, B., Jordán, T.: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory Ser. B 94, 31–77 (2005)

    Article  MATH  Google Scholar 

  8. Kant, G.: Algorithms for drawing planar graphs. Ph.D. thesis, Dept. of Computer Science, Utrecht University (1993)

  9. Kant, G.: Augmenting outerplanar graphs. J. Algorithms 21, 1–25 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Nagamochi, H., Ibaraki, T.: Deterministic O(nm) time edge-splitting in undirected graphs. J. Comb. Optim. 1, 5–46 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. J. Comput. Syst. Sci. 35, 96–144 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  12. Watanabe, T., Nakamura, A.: A smallest augmentation to 3-connect a graph. Discrete Appl. Math. 28, 183–186 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. Métodos Estadísticos, IUMA, Universidad de Zaragoza, Pl. San Francisco s/n, 50009, Zaragoza, Spain

    A. García & J. Tejel

  2. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Jordi Girona, 08034, Barcelona, Spain

    F. Hurtado & M. Noy

Authors
  1. A. García
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Hurtado
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Noy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Tejel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Noy.

Additional information

Research of A. García and J. Tejel partially supported by DGA2006 E58 22880 and MEC MTM2006-01267.

Research of F. Hurtado and M. Noy partially supported by MCYT BFM2003-0368, MEC MTM2006-01267, DURSI 2005SGR00692 and MTM2005-08618-C02-01.

Rights and permissions

Reprints and permissions

About this article

Cite this article

García, A., Hurtado, F., Noy, M. et al. Augmenting the Connectivity of Outerplanar Graphs. Algorithmica 56, 160–179 (2010). https://doi.org/10.1007/s00453-008-9167-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9167-1

Keywords

Search

Navigation