Linkless symmetric drawings of series parallel digraphs

DOI10.1016/j.comgeo.2004.04.004zbMath1050.05036OpenAlexW2071180891MaRDI QIDQ1886237

Peter Eades, Seok-Hee Hong, Jonathan A. Hillman

Publication date: 18 November 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.04.004

zbMATH Keywords

SymmetryGraph drawingThree dimensionsDrawing algorithmLinear time algorithmSeries parallel digraphs

Mathematics Subject Classification ID

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) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Geometric automorphism groups of graphs

Uses Software

• PIGALE

Cites Work

• Three-dimensional graph drawing
• Fast detection and display of symmetry in outerplanar graphs
• Three-dimensional orthogonal graph drawing algorithms
• Spring algorithms and symmetry
• Drawing series parallel digraphs symmetrically
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Sachs' linkless embedding conjecture
• 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
• The Recognition of Series Parallel Digraphs
• HOW TO DRAW A SERIES-PARALLEL DIGRAPH
• Linkless embeddings of graphs in 3-space
• Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linkless symmetric drawings of series parallel digraphs