Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
DOI10.1007/978-3-319-73915-1_34zbMath1503.68226arXiv1708.07428MaRDI QIDQ4625134
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science, ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.07428
graph drawing; NP-hardness; level planarity; upward drawings; orthogeodesic drawings; point-set embedability
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C62: Graph representations (geometric and intersection representations, etc.)
