Optimal upward planarity testing of single-source digraphs

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 132-169

  Bertolazzi, Paola ^a   Di Battista, Giuseppe ^b   Mannino, Carlo ^a,c   Tamassia, Roberto ^d  

^a CNR   (Italy)

^b ROMA TRE UNIVERSITY   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d Brown Univerity   (United States)

Author keywords

Graph drawing; Parallel algorithm; Planar graph; Triconnected components; Upward drawing

Indexed keywords

EID: 0008962239     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794279626     Document Type: Article

References (34)

1. P. BERTOLAZZI, R. F. COHEN, G. DI BATTISTA, R. TAMASSIA, AND I. G. TOLLIS, How to draw a series-parallel digraph, in Proc. 3rd Scand. Workshop Algorithm Theory, Lecture Notes in Comput. Sci. 621, Springer-Verlag, Berlin, 1992, pp. 272-283.
2. P. BERTOLAZZI, R. F. COHEN, G. DI BATTISTA, R. TAMASSIA, AND I. G. TOLLIS, How to draw a series-parallel digraph, Internat. J. Comput. Geom. Appl., (4) 1994, pp. 385-402.
3. P. BERTOLAZZI AND G. DI BATTISTA, On upward drawing testing of triconnected digraphs, in Proc. 7th Annual ACM Sympos. Comput. Geom., 1991, ACM, New York, pp. 272-280.
4. P. BERTOLAZZI, G. DI BATTISTA, G. LIOTTA, AND C. MANNING, Upward drawings of triconnected digraphs, Algorithmica, 12 (1994), pp. 476-497.
5. R. COLE AND U. VISHKIN, Approximate, and exact parallel scheduling with applications to list, tree, and graph problems, in Proc. 27th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1986, pp. 478-491.
6. P. CRESCENZI, G. DI BATTISTA, AND A. PIPERNO, A note on optimal area algorithms for upward drawings of binary trees, Comput. Geom. Theory Appl., 2 (1992), pp. 187-200.
7. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. Theory Appl., 4 (1994), pp. 235-282.
8. G. DI BATTISTA, W. P. LIU, AND I. RIVAL, Bipartite graphs upward drawings and planarity, Inform. Process. Lett., 36 (1990), pp. 317-322.
9. G. DI BATTISTA AND R. TAMASSIA, Algorithms for plane representations of acyclic digraphs, Theoret. Comput. Sci., 61 (1988), pp. 175-198.
10. G. DI BATTISTA AND R. TAMASSIA, On-line graph algorithms with spqr-trees, in Automata, Languages and Programming (Proc. 17th ICALP), Lecture Notes in Comput. Sci. 442, Springer-Verlag, New York, 1990, pp. 598-611.
11. G. DI BATTISTA AND R. TAMASSIA, On-line maintenance of triconnected components with SPQR-trees, Algorithmica, 15 (1996), pp. 302-318.
12. 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.
13. P. EADES, T. LIN, AND X. LIN, Minimum size h-v drawings, in Advanced Visual Interfaces (Proc. AVI '92), World Scientific Series in Computer Science 36, World Scientific, River Edge, NJ, 1992, pp. 386-394.
14. D. FUSSELL, V. RAMACHANDRAN, AND R. THURIMELLA, Finding triconnected components by local replacements, in Automata, Languages and Programming (Proc. 16th ICALP), Lecture Notes in Comput. Sci. 372, Springer-Verlag, New York, 1989, pp. 379-393.
15. A. GARG, M. T. GOODRICH, AND R. TAMASSIA, Area-efficient upward tree drawings, in Proc. 9th Annual ACM Sympos. Comput. Geom., ACM, New York, 1993, pp. 359-368.
16. A. GARG AND R. TAMASSIA, On the computational complexity of upward and rectilinear planarity testing, in Proc. Graph Drawing '94, Lecture Notes in Comput. Sci. 894, Springer-Verlag, New York, 1995, pp. 286-297.
17. J. HOPCROFT AND R. E. TARJAN, Dividing a graph into triconnected components, SIAM J. Comput., 2 (1973), pp. 135-158.
18. J. HOPCROFT AND R. E. TARJAN, Efficient planarity testing, J. ACM, 21 (1974), pp. 549-568.
19. M. D. HUTTON AND A. LUBIW, Upward planar drawing of single source acyclic digraphs, in Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, San Francisco, CA, SIAM, Philadelphia, 1991, pp. 203-211.
20. M.-Y. KAO AND G. E. SHANNON, Local reorientations, global order, and planar topology, in Proc. 30th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 286-296.
21. D. KELLY, Fundamentals of planar ordered sets, Discrete Math., 63 (1987), pp. 197-216.
22. D. KELLY AND I. RIVAL, Planar lattices, Canad. J. Math., 27 (1975), pp. 636-665.
23. A. LEMPEL, S. EVEN, AND I. CEDERBAUM, An algorithm for planarity testing of graphs, in Theory of Graphs: Internat. Symposium, Rome, 1966, Gordon and Breach, New York, 1967, pp. 215-232.
24. L. LOVASZ AND M. D. PUMMER, Matching Theory, Ann. Discrete Math. 29, North-Holland, Amsterdam, 1986.
25. A. PAPAKOSTAS, Upward planarity testing of outerplanar dags, in Proc. Graph Drawing '94, Lecture Notes in Comput. Sci. 894, Springer-Verlag, New York, 1995, pp. 298-306.
26. C. PLATT, Planar lattices and planar graphs, J. Combin. Theory Ser. B, 21 (1976), pp. 30-39.
27. V. RAMACHANDRAN AND J. REIF, Planarity Testing in Parallel, Tech. Report TR-90-15, Department of Computer Science, University of Texas at Austin, 1990.
28. V. RAMACHANDRAN AND J. H. REIF, An optimal parallel algorithm for graph planarity, in Proc. 30th Annual IEEE Sympos. Found. Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 282-293.
29. E. REINGOLD AND J. TILFORD, Tidier drawing of trees, IEEE Trans. Software Eng., SE-7(1981), pp. 223-228.
30. I. RIVAL, Reading, drawing, and order, in Algebras and Orders, I. G. Rosenberg and G. Sabidussi, eds., Kluwer Academic Publishers, Norwell, MA, 1993, pp. 359-404.
31. K. J. SUPOWIT AND E. M. REINGOLD, The complexity of drawing trees nicely, Acta Inform., 18 (1983), pp. 377-392.
32. R. TAMASSIA AND J. S. VITTER, Parallel transitive closure and point location in planar structures, SIAM J. Comput., 20 (1991), pp. 708-725.
33. C. THOMASSEN, Planar acyclic oriented graphs, Order, 5 (1989), pp. 349-361.
34. W. T. TROTTER AND J. MOORE, The dimension of planar posets, J. Combin. Theory Ser. B., 22 (1977), pp. 54-67.