Variants of Plane Diameter Completion

DOI10.4230/LIPIcs.IPEC.2015.30zbMath1378.68078arXiv1509.00757MaRDI QIDQ5363757

Petr A. Golovach, Dimitrios M. Thilikos, Clément Requilé

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1509.00757

zbMATH Keywords

dynamic programming; planar graphs; parameterized algorithms; graph modification problems; branchwidth

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C10: Planar graphs; geometric and topological aspects of graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)