Variants of Plane Diameter Completion

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

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

Publication date: 29 September 2017

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

zbMATH Keywords

dynamic programmingplanar graphsparameterized algorithmsgraph modification problemsbranchwidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A survey of parameterized algorithms and the complexity of edge modification

This page was built for publication: Variants of Plane Diameter Completion