Metraipolis › archive › dc_71dfbabd5d1e

Connectivity Augmentation of Plane Graphs — arXiv:2608.10848

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10848
License (as archived)
CC0-1.0
Archived
2026-10-19T06:37:01.880Z
SHA-256 of the archived text
861f8d57a51fb9be8575aaca0654021bb50ea182deca440cddb9dfec19b4675b
Stable URL of this page
https://metraipolis.com/documento/dc_71dfbabd5d1e

How to cite

Connectivity Augmentation of Plane Graphs — arXiv:2608.10848 — arXiv (en), https://arxiv.org/abs/2608.10848 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71dfbabd5d1e (Metraipolis archive dc_71dfbabd5d1e, sha256 861f8d57a51fb9be8575aaca0654021bb50ea182deca440cddb9dfec19b4675b)
BibTeX
@misc{dc71dfbabd5d1e,
  title = {Connectivity Augmentation of Plane Graphs — arXiv:2608.10848},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10848},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71dfbabd5d1e; sha256 861f8d57a51fb9be8575aaca0654021bb50ea182deca440cddb9dfec19b4675b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10848. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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+\alpha(|V|)))\) time and linear space, where \(\alpha\) is the inverse Ackermann function.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.10848 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T06:28:19.215Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).