On the computational complexity of upward and rectilinear planarity testing

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 601-625

  Garg, Ashim ^a   Tamassia, Roberto ^b  

^a the State University of New York   (United States)

^b Brown Univerity   (United States)

Author keywords

Algorithm; Approximation algorithm; Computational complexity; Graph drawing; Layout; NP complete problem; Ordered set; Orthogonal drawing; Planar drawing; Planar graph; Rectilinear drawing; Upward drawing

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

PLANARITY TESTING;

COMPUTATIONAL COMPLEXITY;

EID: 0036247827     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794277123     Document Type: Article

References (35)

1. 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.
2. P. BERTOLAZZI AND G. DI BATTISTA, On upward drawing testing of triconnected digraphs, in Proceedings of the 7th Annual Symposium on Computational Geometry, North Conway, NH, 1991, pp. 272-280.
3. P. BERTOLAZZI, G. DI BATTISTA, G. LIOTTA, AND C. MANNINO, Upward drawings of triconnected digraphs, Algorithmica, 6 (1994), pp. 476-497.
4. P. BERTOLAZZI, G. DI BATTISTA, C. MANNINO, AND R. TAMASSIA, Optimal upward planarity testing of single-source digraphs, SIAM J. Comput., 27 (1998), pp. 132-169.
5. T. BIEDL AND G. KANT, A better heuristic for orthogonal graph drawings, Comput. Geom., 9 (1998), pp. 159-180.
6. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Algorithms for drawing graphs: An annotated bibliography, Comput. Geom., 4 (1994), pp. 235-282.
7. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.
8. G. DI BATTISTA, G. LIOTTA, AND F. VARGIU, Spirality and optimal orthogonal drawings, SIAM J. Comput., 27 (1998), pp. 1764-1811.
9. G. DI BATTISTA, W. P. LIU, AND I. RIVAL, Bipartite graphs upward drawings and planarity, Inform. Process. Lett., 36 (1990), pp. 317-322.
10. G. DI BATTISTA AND R. TAMASSIA, Algorithms for plane representations of acyclic digraphs, Theoret. Comput. Sci., 61 (1988), pp. 175-198.
11. 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.
12. S. EVEN AND G. GRANOT, Rectilinear Planar Drawings with Few Bends in Each Edge, Technical report 797, Computer Science Department, Technion, Haifa, Israel, 1994.
13. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
14. M. D. HUTTON AND A. LUBIW, Upward planar drawing of single-source acyclic digraphs, SIAM J. Comput., 25 (1996), pp. 291-311.
15. G. KANT, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996), pp. 4-32.
16. D. KELLY, Fundamentals of planar ordered sets, Discrete Math., 63 (1987), pp. 197-216.
17. D. KELLY AND I. RIVAL, Planar lattices, Canad. J. Math., 27 (1975), pp. 636-665.
18. A. LEMPEL, S. EVEN, AND I. CEDERBAUM, An algorithm for planarity testing of graphs, in Theory of Graphs, Gordon and Breach, New York, 1967, pp. 215-232.
19. Y. LIU, P. MARCHIORO, AND R. PETRESCHI, At most single-bend embeddings of cubic graphs, Appl. Math. J. Chinese Univ. Ser. B, 9 (1994), pp. 127-142.
20. Y. LIU, P. MARCHIORO, R. PETRESCHI, AND B. SIMEONE, Theoretical Results on at Most 1-Bend Embeddability of Graphs, Technical report, Dipartimento di Statistica, Università di Roma "La Sapienza," Rome, Italy, 1990.
21. Y. LIU, A. MORGANA, AND B. SIMEONE, General theoretical results on rectilinear embeddability of graphs, Acta Math. Appl. Sinica, 7 (1991), pp. 187-192.
22. Y. LIU, A. MORGANA, AND B. SIMEONE, A Linear Algorithm for 3-Bend Embeddings of Planar Graphs in the Grid, manuscript, 1993.
23. A. PAPAKOSTAS, Upward planarity testing of outerplanar dags, in Graph Drawing, R. Tamassia and I. G. Tollis, eds., Lecture Notes in Comput. Sci. 894, Springer-Verlag, Berlin, 1995, pp. 298-306.
24. C. PLATT, Planar lattices and planar graphs, J. Combin. Theory Ser. B, 21 (1976), pp. 30-39.
25. I. RIVAL, The diagram, in Graphs and Order, I. Rival, ed., Reidel, Dordrecht, the Netherlands, 1985, pp. 103-133.
26. I. RIVAL, Graphical data structures for ordered sets, in Algorithms and Order, I. Rival, ed., Kluwer Academic Publishers, Dordrecht, the Netherlands, 1989, pp. 3-31.
27. I. RIVAL, Reading, drawing, and order, in Algebras and Orders, I. G. Rosenberg and G. Sabidussi, eds., Kluwer Academic Publishers, Dordrecht, the Netherlands, 1993, pp. 359-404.
28. Y. SHILOACH, Arrangements of Planar Graphs on the Planar Lattice, Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel, 1976.
29. J. A. STORER, On minimal node-cost planar embeddings, Networks, 14 (1984), pp. 181-212.
30. R. TAMASSIA, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16 (1987), pp. 421-444.
31. R. TAMASSIA AND I. G. TOLLIS, Planar grid embedding in linear time, IEEE Trans. Circuits Systems, 36 (1989), pp. 1230-1234.
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. L. VALIANT, Universality considerations in VLSI circuits, IEEE Trans. Comput., 30 (1981), pp. 135-140.
35. G. VIJAYAN AND A. WIGDERSON, Rectilinear graphs and their embeddings, SIAM J. Comput., 14 (1985), pp. 355-372.