# Variants of Plane Diameter Completion

2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The {\sc Plane Diameter Completion} problem asks, given a plane graph $G$ and a positive integer $d$, if it is a spanning subgraph of a plane graph $H$ that has diameter at most $d$. We examine two variants of this problem where the input comes with another parameter $k$. In the first variant, called BPDC, $k$ upper bounds the total number of edges to be added and in the second, called BFPDC, $k$ upper bounds the number of additional edges per face. We prove that both problems are {\sf NP}-complete, the first even for 3-connected graphs of face-degree at most 4 and the second even when $k=1$ on 3-connected graphs of face-degree at most 5. In this paper we give parameterized algorithms for both problems that run in $O(n^{3})+2^{2^{O((kd)^2\log d)}}\cdot n$ steps.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [15 references]

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01225566
Contributor : Dimitrios Thilikos Connect in order to contact the contributor
Submitted on : Friday, March 16, 2018 - 7:39:05 PM
Last modification on : Monday, October 11, 2021 - 1:24:08 PM
Long-term archiving on: : Tuesday, September 11, 2018 - 1:15:21 AM

### File

6.pdf
Files produced by the author(s)

### Citation

Clément Requilé, Dimitrios M. Thilikos, Petr A. Golovach. Variants of Plane Diameter Completion. IPEC: International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩. ⟨lirmm-01225566⟩

Record views