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

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 89; pp. 315 - 327
Main Authors:	Cohen, Nathann, Gonçalves, Daniel, Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M., Weller, Mathias
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2017 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!