A polynomial-time algorithm for Outerplanar Diameter Improvement

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. Outerplan...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 89; s. 315 - 327
Hlavní autoři: Cohen, Nathann, Gonçalves, Daniel, Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M., Weller, Mathias
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.11.2017
Elsevier
Témata:
Combinatorics
Completion problems
Computational Complexity
Computer Science
Data Structures and Algorithms
Diameter improvement
Dynamic programming
Mathematics
Outerplanar graphs
Polynomial-time algorithms
Diameter improvement
Outerplanar graphs
Polynomial-time algorithms
Completion problems
Dynamic programming
ISSN:0022-0000, 1090-2724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. •The goal of Outerplanar Diameter Improvement is to add edges to a graph G to obtain an outerplanar graph of diameter at most D.•We provide a dynamic programming algorithm that solves the problem in polynomial time.•This problem has structural analogues to the open problem Planar Diameter Improvement, where the resulting graph should be planar.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2017.05.016