2026-07-23T06:19:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12699 2024-03-06T10:50:36Z ddc:004 open_access

Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard Ganian, Robert Hamm, Thekla Klute, Fabian Nöllenburg, Martin Extension problems 1-planarity The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph G, a connected subgraph H of G and a drawing H of H, the extension problem asks whether H can be extended into a drawing of G while maintaining some desired property of the drawing (e.g., planarity). In their breakthrough result, Angelini et al. [ACM TALG 2015] showed that the extension problem is polynomial-time solvable when the aim is to preserve planarity. Very recently we considered this problem for partial 1-planar drawings [ICALP 2020], which are drawings in the plane that allow each edge to have at most one crossing. The most important question identified and left open in that work is whether the problem can be solved in polynomial time when H can be obtained from G by deleting a bounded number of vertices and edges. In this work, we answer this question positively by providing a constructive polynomial-time decision algorithm. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Eduard Eiben and Robert Ganian and Thekla Hamm and Fabian Klute and Martin Nöllenburg 2020 Is Part Of LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2020.31 urn:nbn:de:0030-drops-126998 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.31 eng https://creativecommons.org/licenses/by/3.0/legalcode