Orthogonal graph drawing with flexibility constraints

DOI10.1007/S00453-012-9705-8MaRDI QIDQ476441zbMATHOpenAlexFDO

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

zbMATH Keywords

embeddingsplanar graphsorthogonal drawingbend minimization

Mathematics Subject Classification ID

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)

Recommendations

• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with inflexible edges
• Orthogonal graph drawing with inflexible edges
• Optimal orthogonal graph drawing with convex bend costs
• Optimal Orthogonal Graph Drawing with Convex Bend Costs

Cites work

• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• A better heuristic for orthogonal graph drawings
• 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
• Faster shortest-path algorithms for planar graphs
• Flow in Planar Graphs with Multiple Sources and Sinks
• Maximal Flow Through a Network
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On the computational complexity of upward and rectilinear planarity testing
• On-Line Planarity Testing
• On-line maintenance of triconnected components with SPQR-trees
• Spirality and Optimal Orthogonal Drawings
• Theoretical results on at most 1-bend embeddability of graphs

Cited in

(17)

• Confluent Orthogonal Drawings of Syntax Diagrams
• Colorability in Orthogonal Graph Drawing
• HV-planarity: algorithms and complexity
• Orthogonal graph drawing with flexibility constraints
• Universal slope sets for 1-bend planar drawings
• Planar embeddings with small and uniform faces
• Orthogonal graph drawing with inflexible edges
• The DFS-heuristic for orthogonal graph drawing
• Orthogonal layout with optimal face complexity
• Grid recognition: classical and parameterized computational perspectives
• Orthogonal graph drawing with inflexible edges
• Optimal orthogonal graph drawing with convex bend costs
• Orthogonal Hypergraph Drawing for Improved Visibility
• Orthogonal planarity testing of bounded treewidth graphs
• Sketched representations and orthogonal planarity of bounded treewidth graphs
• Relating bends and size in orthogonal graph drawings
• Interactive orthogonal graph drawing

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)