A Polynomial-time Algorithm for Outerplanar Diameter Improvement
Data Structures and Algorithms
2014-05-26 v3 Discrete Mathematics
Combinatorics
Abstract
The Outerplanar Diameter Improvement problem asks, given a graph and an integer , whether it is possible to add edges to in a way that the resulting graph is outerplanar and has diameter at most . 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.
Cite
@article{arxiv.1403.5702,
title = {A Polynomial-time Algorithm for Outerplanar Diameter Improvement},
author = {Nathann Cohen and Daniel Gonçalves and Eun Jung Kim and Christophe Paul and Ignasi Sau and Dimitrios M. Thilikos and Mathias Weller},
journal= {arXiv preprint arXiv:1403.5702},
year = {2014}
}
Comments
24 pages