A polynomial-time algorithm for outerplanar diameter improvement
From MaRDI portal
Publication:2402366
DOI10.1016/j.jcss.2017.05.016zbMath1372.05216arXiv1403.5702MaRDI QIDQ2402366
Christophe Paul, Mathias Weller, Ignasi Sau, Dimitrios M. Thilikos, Eun Jung Kim, Daniel Gonçalves, Nathann Cohen
Publication date: 7 September 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5702
dynamic programming; outerplanar graphs; completion problems; polynomial-time algorithms; diameter improvement
90C39: Dynamic programming
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)