Orthogonal Graph Drawing with Inflexible Edges
DOI10.1007/978-3-319-18173-8_4zbMath1460.68072arXiv1404.2943OpenAlexW1682423028MaRDI QIDQ2947010
Thomas Bläsius, Ignaz Rutter, Sebastian B. C. Lehmann
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.2943
Graph theory (including graph drawing) in computer science (68R10) 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) Flows in graphs (05C21)
Related Items (1)
Cites Work
- Orthogonal graph drawing with flexibility constraints
- A better heuristic for orthogonal graph drawings
- On-line maintenance of triconnected components with SPQR-trees
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Orthogonal Graph Drawing with Inflexible Edges
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Accelerated Bend Minimization
This page was built for publication: Orthogonal Graph Drawing with Inflexible Edges
