Upward planar drawing of single-source acyclic digraphs

SIAM Journal on Computing

Volumn 25, Issue 2, 1996, Pages 291-311

  Hutton, Michael D ^a   Lubiw, Anna ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Algorithms; Directed graph; Graph decomposition; Graph drawing; Graph embedding; Graph recognition; Planar graph; Upward planar

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; GRAPHIC METHODS; POLYNOMIALS; THEOREM PROVING;

ACYCLIC GRAPH; CURVE MONOTONE; DIAGRAPHS; DIRECTED GRAPH; GRAPH DECOMPOSITION; GRAPH DRAWING; GRAPH EMBEDDING; GRAPH RECOGNITION; PLANAR GRAPH; UPWARD PLANAR;

ALGORITHMS;

EID: 0030128034     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792235906     Document Type: Article

References (27)

1. P. BERTOLAZZI AND G. Di BATTISTA, On upward drawing testing of triconnected digraphs, in Proc. 7th ACM Symposium on Computational Geometry, 1991, pp. 272-280, Tech. report RAP.18.90, Dipartimento di Informatica e Sistemistica, Università degli Studi di Roma "La Sapienza," 1991.
2. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, MacMillian, New York, 1976.
3. K. S. BOOTH AND G. S. LUEKER, Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
4. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, Small sets supporting Fáry embeddings of planar graphs, in Proc. 20th ACM Symposium on the Theory of Computing (STOC), 1988, pp. 426-433.
5. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Algorithms for drawing graphs: An annotated bibliography, preprint, Department of Computer Science, Brown University, Providence, RI, 1993; ongoing version available via anonymous ftp from ftp.cs.brown.edu:pub/papers/compgeo/, gdbiblio.tex.Z, and gdbiblio.ps.Z.
6. G. DI BATTISTA, W. LIU, AND I. RIVAL, Bipartite graphs, upward drawings, and planarity, Inform. Process. Lett., 36 (1990), pp. 317-322.
7. G. DI BATTISTA AND R. TAMASSIA, Algorithms for plane representations of acyclic digraphs, Theoret. Comput. Sci., 61 (1988), pp. 175-178.
8. G. DI BATTISTA, R. TAMASSIA, AND I. G. TOLLIS, Area requirement and symmetry display of planar upward drawings, Discrete Comput. Geom., 7 (1992), pp. 381-401.
9. D. DOLEV, F. T. LEIGHTON, AND H. TRICKEY, Planar embedding of planar graphs, in Advances in Computing Research, Vol. 2, F. P. Preparata, ed., JAI Press Inc., Greenwich, CT, 1984, pp. 147-161.
10. I. FÁRY, On straight line representations of planar graphs, Acta. Sci. Math. (Szeged), 11 (1948), pp. 229-233.
11. O(g)) steps, in Proc. 11th ACM Symposium on the Theory of Computing (STOC), 1979, pp. 27-37.
12. A. GARG AND R. TAMASSIA, On the computational complexity of upward and rectilinear planarity testing, Tech. report CS-94-10, Department of Computer Science, Brown University, Providence, RI, 1994.
13. J. HOPCROFT AND R. E. TARJAN, Dividing a graph into triconnected components, SIAM J. Comput., 2 (1972), pp. 135-158.
14. J. HOPCROFT AND R. E. TARJAN, Efficient planarity testing, J. Assoc. Comput. Mach., 21 (1974), pp. 549-568.
15. M. D. HUTTON, Upward planar drawing of single source acyclic digraphs, Master's thesis, University of Waterloo, Waterloo, ON, Canada, 1990.
16. M. D. HUTTON AND A. LUBIW, Upward planar drawing of single-source acyclic digraphs in Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1991, pp. 203-211.
17. D. KELLY, Fundamentals of planar ordered sets, Discrete Math., 63 (1987), pp. 197-216.
18. D. KELLY AND I. RIVAL, Planar lattices, Canad. J. Math., 27 (1975), pp. 636-665.
19. C. R. PLATT, Planar lattices and planar graphs, J. Combin. Theory Ser. B, 21 (1976), pp. 30-39.
20. W. SCHNYDER, Embedding planar graphs on the grid, in Proc. 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 138-148.
21. S. K. STEIN, Convex maps, Proc. Amer. Math. Soc., 2 (1951), pp. 464-466.
22. E. STEINITZ AND H. RADEMACHER, Vorlesungen über die Theorie de Polyeder, Julius Springer, Berlin, 1934.
23. R. E. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 145-159.
24. C. THOMASSEN, Planar acyclic oriented graphs, Order, 5 (1989), pp. 349-361.
25. W. T. TUTTE, Convex representations of graphs, Proc. London Math. Soc., 10 (1960), pp. 304-320.
26. K. WAGNER, Bemerkungen zum vierfarbenproblem, Jahresber. Deutsch. Math.-Verein., 46 (1936), pp. 26-32.
27. W. T. TROTTER, Ed., Planar Graphs, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 9, American Mathematical Society, Providence, RI, 1993, pp. 41-57.