Drawing series parallel digraphs symmetrically
type: Item
instance of: scholarly article
title: Drawing series parallel digraphs symmetrically
zbMATH Open document ID: 0969.68119
DOI: 10.1016/S0925-7721(00)00020-1
author: Seok-Hee Hong
author: Peter Eades
author: Sang-Ho Lee
published in: Computational Geometry
publication date: 2001-06-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1568637
zbMATH Keywords: upward planar automorphism
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4871775
cites work: Q4501707
cites work: HOW TO DRAW A SERIES-PARALLEL DIGRAPH
cites work: Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
cites work: Spring algorithms and symmetry
cites work: Q4249532
cites work: Some NP-Complete Problems Similar to Graph Isomorphism
cites work: Q4729805
cites work: Fast detection and display of symmetry in outerplanar graphs
cites work: A note on the graph isomorphism counting problem
cites work: A unified approach to visibility representations of planar graphs
cites work: The Recognition of Series Parallel Digraphs
cites work: Q5512231
full work available at URL: s0925-7721(00)00020-1
OpenAlex ID: W1492709831
description: scientific article; zbMATH DE number 1568637