Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs

DOI10.1137/S0097539792235724zbMath0836.68041MaRDI QIDQ4857590

Giuseppe Di Battista, R. F. Cohen, Roberto Tamassia, Ioannis. G. Tollis

Publication date: 11 April 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

graph theorycomputational geometrydrawing graphsdynamic drawing algorithmsplanar \(st\)-digraphs

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items

Linkless symmetric drawings of series parallel digraphs ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Untangling circular drawings: algorithms and complexity ⋮ Small Point-Sets Supporting Graph Stories ⋮ Offline Drawing of Dynamic Trees: Algorithmics and Document Integration ⋮ Small point-sets supporting graph stories ⋮ Visualizing evolving trees ⋮ Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs ⋮ Graph Stories in Small Area ⋮ Graph stories in small area ⋮ Unnamed Item ⋮ Upward planar morphs ⋮ Upward planar morphs ⋮ Drawing series parallel digraphs symmetrically ⋮ Incremental convex planarity testing