Orthogonal graph drawing with flexibility constraints
DOI10.1007/S00453-012-9705-8zbMATH Open1303.05182OpenAlexW2087261591MaRDI QIDQ476441FDOQ476441
Authors: Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner 
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000019793
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) 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
- Maximal Flow Through a Network
- 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
- On the computational complexity of upward and rectilinear planarity testing
- Flow in Planar Graphs with Multiple Sources and Sinks
- Faster shortest-path algorithms for planar graphs
- On-line maintenance of triconnected components with SPQR-trees
- Theoretical results on at most 1-bend embeddability of graphs
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
- Spirality and Optimal Orthogonal Drawings
Cited In (17)
- Universal slope sets for 1-bend planar drawings
- Orthogonal planarity testing of bounded treewidth graphs
- Interactive orthogonal graph drawing
- Colorability in Orthogonal Graph Drawing
- Orthogonal layout with optimal face complexity
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
- HV-planarity: algorithms and complexity
- Relating bends and size in orthogonal graph drawings
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with inflexible edges
- The DFS-heuristic for orthogonal graph drawing
- Planar Embeddings with Small and Uniform Faces
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Grid recognition: classical and parameterized computational perspectives
- Orthogonal Graph Drawing with Inflexible Edges
- Orthogonal Hypergraph Drawing for Improved Visibility
- Confluent Orthogonal Drawings of Syntax Diagrams
This page was built for publication: Orthogonal graph drawing with flexibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476441)
