HV-planarity: algorithms and complexity
From MaRDI portal
Publication:1628786
DOI10.1016/j.jcss.2018.08.003zbMath1409.68211OpenAlexW2890307102WikidataQ62042358 ScholiaQ62042358MaRDI QIDQ1628786
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
Publication date: 10 December 2018
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2018.08.003
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Drawing two posets, Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time, Grid recognition: classical and parameterized computational perspectives, Sketched representations and orthogonal planarity of bounded treewidth graphs, Parameterized complexity of graph planarity with restricted cyclic orders, Parameterized complexity of graph planarity with restricted cyclic orders, Orthogonal planarity testing of bounded treewidth graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bend-optimal orthogonal graph drawing in the general position model
- The shape of orthogonal cycles in three dimensions
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- Embedding rectilinear graphs in linear time
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Some simplified NP-complete graph problems
- Graph drawing software
- Turn-regularity and optimal area drawings of orthogonal representations
- Fixed edge-length graph drawing is NP-hard
- Embedding problems for paths with direction constrained edges.
- Empirical evaluation of aesthetics-based graph layout
- A note on 3D orthogonal drawings with direction constrained edges
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Upward Spirality and Upward Planarity Testing
- Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Rectilinear Graphs and Their Embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Efficient Planarity Testing
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Graph Drawing and Applications for Software and Knowledge Engineers
- Computing orthogonal drawings with the minimum number of bends
- Orthogonal Drawings of Plane Graphs Without Bends
- Drawing database schemas
- Drawing HV-Restricted Planar Graphs
- Bend Minimization in Planar Orthogonal Drawings Using Integer Programming
- A Contribution to the Theory of Chromatic Polynomials
- Graph Drawing
- Drawing graphs. Methods and models
