Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- 1 October 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (5) , 970-1001
- https://doi.org/10.1137/s0097539792235724
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- HOW TO DRAW A SERIES-PARALLEL DIGRAPHInternational Journal of Computational Geometry & Applications, 1994
- Area requirement and symmetry display of planar upward drawingsDiscrete & Computational Geometry, 1992
- Bipartite graphs, upward drawings, and planarityInformation Processing Letters, 1990
- How to draw a planar graph on a gridCombinatorica, 1990
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Biased Search TreesSIAM Journal on Computing, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Representing a planar graph by vertical lines joining different levelsDiscrete Mathematics, 1983
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978