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

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!