Triangulating planar graphs while minimizing the maximum degree

DOI10.1007/3-540-55706-7_22zbMath1502.68234WikidataQ59568017 ScholiaQ59568017MaRDI QIDQ5056146

Hans L. Bodlaender, Goos Kant

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55706-7_22

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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)

Related Items

One strike against the min-max degree triangulation problem