A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
From MaRDI portal
Publication:3194712
DOI10.1007/978-3-319-20297-6_9zbMath1464.68280MaRDI QIDQ3194712
Christophe Paul, Mathias Weller, Ignasi Sau, Dimitrios M. Thilikos, Eun Jung Kim, Daniel Gonçalves, Nathann Cohen
Publication date: 20 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_9
dynamic programming; outerplanar graphs; completion problems; polynomial-time algorithms; diameter improvement
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)