A Polynomial-Time Algorithm for Outerplanar Diameter Improvement - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement

Résumé

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.

Dates et versions

hal-01178222 , version 1 (17-07-2015)

Identifiants

Citer

Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, et al.. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩. ⟨hal-01178222⟩
242 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More