On the Hardness of Orthogonal-Order Preserving Graph Drawing

DOI10.1007/978-3-642-00219-9_25zbMath1213.68428OpenAlexW1486733957MaRDI QIDQ3611858

Barbara Pampel, Ulrik Brandes

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_25

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

On d-Regular Schematization of Embedded Paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-linear time approximation algorithms for curve simplification
• Fixed edge-length graph drawing is NP-hard
• Path Simplification for Metro Map Layout
• Trees with Convex Faces and Optimal Angles
• A User Study in Similarity Measures for Graph Drawing
• Graph Drawing
• Graph Drawing
• Algorithms and Computation

This page was built for publication: On the Hardness of Orthogonal-Order Preserving Graph Drawing