Orthogonal graph drawing with inflexible edges
DOI10.1016/J.COMGEO.2016.03.001zbMATH Open1384.05115OpenAlexW2298171962MaRDI QIDQ679739FDOQ679739
Authors: Thomas Bläsius, Ignaz Rutter, Sebastian B. C. Lehmann 
Publication date: 19 January 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.03.001
Recommendations
- Orthogonal graph drawing with inflexible edges
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with flexibility constraints
- Publication:4952592
- scientific article; zbMATH DE number 1693471
- Orthogonal drawings of graphs with vertex and edge labels
- Interactive orthogonal graph drawing
- scientific article; zbMATH DE number 2084292
- Orthogonal Drawings of Plane Graphs Without Bends
- Ortho-radial drawing of graphs
computational complexityparameterized algorithmbend minimizationplanar embeddingorthgonal graph drawing
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- On-Line Planarity Testing
- A better heuristic for orthogonal graph drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Orthogonal graph drawing with flexibility constraints
- On the computational complexity of upward and rectilinear planarity testing
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- On-line maintenance of triconnected components with SPQR-trees
- Spirality and Optimal Orthogonal Drawings
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- Accelerated bend minimization
Cited In (22)
- Universal slope sets for 1-bend planar drawings
- Orthogonal planarity testing of bounded treewidth graphs
- Interactive orthogonal graph drawing
- Orthogonal layout with optimal face complexity
- HV-planarity: algorithms and complexity
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Relating bends and size in orthogonal graph drawings
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- Extending partial orthogonal drawings
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Orthogonal layout with optimal face complexity
- A topology-shape-metrics framework for ortho-radial graph drawing
- Planar rectilinear drawings of outerplanar graphs in linear time
- Extending Partial Orthogonal Drawings
- Orthogonal Drawings of Plane Graphs Without Bends
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Optimal morphs of planar orthogonal drawings
- An SPQR-tree-like embedding representation for upward planarity
- Optimal morphs of planar orthogonal drawings. II
This page was built for publication: Orthogonal graph drawing with inflexible edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679739)
