Document Open Access Logo

Connectivity Augmentation of Plane Graphs

Authors Krishnan Dehaleesan , Asif Khan , Pranabendu Misra

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2026.23.pdf
  • Filesize: 0.99 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Mathematics of computing → Graph algorithms
Keywords
  • Connectivity augmentation
  • Plane graphs
  • Bridgetree
  • BC-tree
  • Balanced graph

Metrics

Abstract

We study the problem of connectivity augmentation of a planar graph, while preserving planarity. This problem is motivated by many real-world settings such as road-networks, power-networks etc. In these settings, it is crucial to preserve the original planar embedding after augmentation.
In 2009, Gutwenger and Mutzel gave a constructive algorithm showing that a connected planar graph with a fixed embedding (a plane graph) can be optimally augmented to a biconnected graph without crossings while preserving the embedding. We further this line of research, by giving an algorithm that computes a minimum set of edges that makes a connected plane graph 2-edge-connected in O(|V|(1+α(|V|))) time and linear space, where α is the inverse Ackermann function.
We also study the 3-vertex-connectivity augmentation of biconnected outerplanar plane graphs. We present the first polynomial-time algorithm that augments such graphs to 3-connectivity with the minimum number of edges in O(|V|(1+α(|V|))) time and linear space while preserving the embedding, i.e. the augmented graph has a planar embedding that extends the given embedding.

Cite As Get BibTex

Krishnan Dehaleesan, Asif Khan, and Pranabendu Misra. Connectivity Augmentation of Plane Graphs. In 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 386, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.MFCS.2026.23

Author Details

Krishnan Dehaleesan
  • University of Bergen, Norway
Asif Khan
  • Chennai Mathematical Institute, India
Pranabendu Misra
  • Chennai Mathematical Institute, India

Funding

  • Khan, Asif: Partially funded by a grant from Infosys foundation.

References

  1. Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, and Torsten Ueckerdt. The Price of Connectivity Augmentation on Planar Graphs. In Vida Dujmović and Fabrizio Montecchiani, editors, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025), volume 357 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:24, Dagstuhl, Germany, 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.GD.2025.23.
  2. M. Abellanas, A. García, F. Hurtado, J. Tejel, and J. Urrutia. Augmenting the connectivity of geometric graphs. Computational Geometry, 40(3):220-230, 2008. URL: https://doi.org/10.1016/j.comgeo.2007.09.001.
  3. Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, and Csaba D. Tóth. Tri-edge-connectivity augmentation for planar straight line graphs. In Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC '09, pages 902-912, Berlin, Heidelberg, 2009. Springer-Verlag. URL: https://doi.org/10.1007/978-3-642-10631-6_91.
  4. Reinhard Diestel. Graph Theory. Springer Publishing Company, Incorporated, 5th edition, 2017. Google Scholar
  5. Kapali P. Eswaran and R. Endre Tarjan. Augmentation problems. SIAM Journal on Computing, 5(4):653-665, 1976. URL: https://doi.org/10.1137/0205044.
  6. Sergej Fialko and Petra Mutzel. A new approximation algorithm for the planar augmentation problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '98, pages 260-269, USA, 1998. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=314613.314714.
  7. A. García, F. Hurtado, M. Noy, and J. Tejel. Augmenting the Connectivity of Outerplanar Graphs. Algorithmica, 56(2):160-179, February 2010. URL: https://doi.org/10.1007/s00453-008-9167-1.
  8. Carsten Gutwenger, Petra Mutzel, and Bernd Zey. On the hardness and approximability of planar biconnectivity augmentation. In Hung Q. Ngo, editor, Computing and Combinatorics, pages 249-257, Berlin, Heidelberg, 2009. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-642-02882-3_25.
  9. Carsten Gutwenger, Petra Mutzel, and Bernd Zey. Planar biconnectivity augmentation with fixed embedding. In Jiří Fiala, Jan Kratochvíl, and Mirka Miller, editors, Combinatorial Algorithms, pages 289-300, Berlin, Heidelberg, 2009. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-642-10217-2_29.
  10. Tanja Hartmann, Jonathan Rollin, and Ignaz Rutter. Cubic augmentation of planar graphs. arXiv preprint arXiv:1209.3865, 2012. URL: https://arxiv.org/abs/1209.3865.
  11. Tanja Hartmann, Jonathan Rollin, and Ignaz Rutter. Regular augmentation of planar graphs. Algorithmica, 73(2):306-370, 2015. URL: https://doi.org/10.1007/S00453-014-9922-4.
  12. T.-S. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pages 548-559, 1991. URL: https://doi.org/10.1109/SFCS.1991.185418.
  13. Tsan-sheng Hsu. On four-connecting a triconnected graph. J. Algorithms, 35(2):202-234, May 2000. URL: https://doi.org/10.1006/jagm.2000.1077.
  14. Bill Jackson and Tibor Jordán. Independence free graphs and vertex connectivity augmentation. Journal of Combinatorial Theory, Series B, 94(1):31-77, 2005. URL: https://doi.org/10.1016/j.jctb.2004.01.004.
  15. Goos Kant. Augmenting outerplanar graphs. J. Algorithms, 21(1):1-25, July 1996. URL: https://doi.org/10.1006/jagm.1996.0034.
  16. Goos Kant and Hans L. Bodlaender. Planar graph augmentation problems. In Frank Dehne, Jörg-Rüdiger Sack, and Nicola Santoro, editors, Algorithms and Data Structures, pages 286-298, Berlin, Heidelberg, 1991. Springer Berlin Heidelberg. Google Scholar
  17. Hiroshi Nagamochi and Peter Eades. Edge-splitting and edge-connectivity augmentation in planar graphs. In Robert E. Bixby, E. Andrew Boyd, and Roger Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, pages 96-111, Berlin, Heidelberg, 1998. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/3-540-69346-7_8.
  18. Ignaz Rutter and Alexander Wolff. Augmenting the connectivity of planar and geometric graphs. Electronic Notes in Discrete Mathematics, 31:53-56, 2008. The International Conference on Topological and Geometric Graph Theory. URL: https://doi.org/10.1016/j.endm.2008.06.009.
  19. Csaba D. Tóth. Connectivity augmentation in planar straight line graphs. European Journal of Combinatorics, 33(3):408-425, 2012. Topological and Geometric Graph Theory. URL: https://doi.org/10.1016/j.ejc.2011.09.002.
  20. László A. Végh. Augmenting undirected node-connectivity by one. SIAM J. Discret. Math., 25(2):695-718, 2011. URL: https://doi.org/10.1137/100787507.
  21. Toshimasa Watanabe and Akira Nakamura. Edge-connectivity augmentation problems. Journal of Computer and System Sciences, 35(1):96-144, 1987. URL: https://doi.org/10.1016/0022-0000(87)90038-9.
  22. Toshimasa Watanabe and Akira Nakamura. A minimum 3-connectivity augmentation of a graph. Journal of Computer and System Sciences, 46(1):91-128, 1993. URL: https://doi.org/10.1016/0022-0000(93)90050-7.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact