A polynomial-time algorithm for Outerplanar Diameter Improvement - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2017

A polynomial-time algorithm for Outerplanar Diameter Improvement

Abstract

The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$. We provide a dynamic programming algorithm that solves this problem in polynomial time. Outerplanar Diameter Improvement demonstrates several structural analogues to the celebrated and challenging Planar Diameter Improvement problem, where the resulting graph should, instead, be planar. The complexity status of this latter problem is open.
Fichier principal
Vignette du fichier
Outerplanar-JCSS-revised.pdf (543.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01592242 , version 1 (22-09-2017)

Identifiers

Cite

Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, et al.. A polynomial-time algorithm for Outerplanar Diameter Improvement. Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩. ⟨hal-01592242⟩
630 View
192 Download

Altmetric

Share

Gmail Facebook X LinkedIn More