Publication:5111244

DOI10.4230/LIPIcs.MFCS.2017.30zbMath1441.68169arXiv1706.05906MaRDI QIDQ5111244

Henning Fernau, Markus L. Schmid, Alexander Grigoriev, Katrin Casel, S. H. Whitesides

Publication date: 26 May 2020

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

zbMATH Keywords

NP-completeness; exact algorithms; visibility graphs; visibility layout

Mathematics Subject Classification ID

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

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

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

05C85: Graph algorithms (graph-theoretic aspects)