Drawing series parallel digraphs symmetrically
From MaRDI portal
Publication:1841117
DOI10.1016/S0925-7721(00)00020-1zbMath0969.68119OpenAlexW1492709831MaRDI QIDQ1841117
Peter Eades, Sang-Ho Lee, Seok-Hee Hong
Publication date: 21 June 2001
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00020-1
Related Items (4)
Linkless symmetric drawings of series parallel digraphs ⋮ Geometric automorphism groups of graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Force-directed layout of order diagrams using dimensional reduction
Cites Work
- A unified approach to visibility representations of planar graphs
- Fast detection and display of symmetry in outerplanar graphs
- A note on the graph isomorphism counting problem
- Spring algorithms and symmetry
- Some NP-Complete Problems Similar to Graph Isomorphism
- The Recognition of Series Parallel Digraphs
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Drawing series parallel digraphs symmetrically