• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

A polynomial-time algorithm for Outerplanar Diameter Improvement

Cohen, Nathann; Gonçalves, Daniel; Kim, Eun Jung; Paul, Christophe; Sau Valls, Ignasi; Thilikos, Dimitrios M. (2017), A polynomial-time algorithm for Outerplanar Diameter Improvement, Journal of Computer and System Sciences, 89, p. 315-327. 10.1016/j.jcss.2017.05.016

Type
Article accepté pour publication ou publié
External document link
https://hal.inria.fr/hal-01592242
Date
2017
Journal name
Journal of Computer and System Sciences
Volume
89
Publisher
Elsevier
Pages
315-327
Publication identifier
10.1016/j.jcss.2017.05.016
Metadata
Show full item record
Author(s)
Cohen, Nathann cc

Gonçalves, Daniel

Kim, Eun Jung
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paul, Christophe

Sau Valls, Ignasi cc

Thilikos, Dimitrios M. cc
Abstract (EN)
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.
Subjects / Keywords
Diameter improvement; Outerplanar graphs; Completion problems; Polynomial-time algorithms; Dynamic programming

Related items

Showing items related by title and author.

  • Thumbnail
    Parameterized algorithms for min-max multiway cut and list digraph homomorphism 
    Kim, Eun Jung; Paul, Christophe; Sau Valls, Ignasi; Thilikos, Dimitrios M. (2017) Article accepté pour publication ou publié
  • Thumbnail
    An FPT 2-Approximation for Tree-Cut Decomposition 
    Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau Valls, Ignasi; Thilikos, Dimitrios M. (2018) Article accepté pour publication ou publié
  • Thumbnail
    An FPT 2-Approximation for Tree-cut Decomposition 
    Kim, Eun Jung; Oum, Sang-Il; Paul, Christophe; Sau Valls, Ignasi; Thilikos, Dimitrios M. (2015) Communication / Conférence
  • Thumbnail
    Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions 
    Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau Valls, Ignasi (2016) Article accepté pour publication ou publié
  • Thumbnail
    Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions 
    Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau Valls, Ignasi; Sikdar, Somnath (2013-07) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo