A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid

Discrete Applied Mathematics

Volumn 81, Issue 1-3, 1998, Pages 69-91

  Liu, Yanpei ^a   Morgana, Aurora ^b   Simeone, Bruno ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b NONE

Author keywords

Graph algorithms; Graph drawing; Planar graphs; Rectilinear embeddings

Indexed keywords

EID: 0042355620     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(97)00076-0     Document Type: Article

References (26)

1. A. Aggarwal, M. Klawe, D. Lichtenstein, N. Linial, A. Wigderson, Multi-layer grid embedding, Proc. IEEE 26th Ann. Symp. Foundations of Computer Science, 1985, pp. 186-196.
2. A. Aggarwal, M. Klawe, P. Shor, Multi-layer grid embedding for VLSI, Algorithmica 6 (1991) 129-151.
3. S. Bhatt, S. Cosmadakis, The complexity of minimizing wire lengths in VLSI layout, Inform. Process. Lett. 25 (1987) 263-267.
4. N. Chiba, T. Nishizeki, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.
5. X. Cui, Y. Liu, Efficient algorithms for rectilinear extensions of standard graphs, Acta Math. Appl. Sinica, to appear.
6. G. Dolev, F.T. Leighton, H. Trickey, Planar embedding of planar graphs, in: F.P. Preparata (Ed.), Advances in Computing Research, vol. 2, Jai Press, 1984, pp. 147-161.
7. J. Ebert, st-numbering the vertices of biconnected graphs, Computing 30 (1983) 19-33.
8. S. Even, Graph Algorithms, Computer Science Press, Potomac,1979.
9. S. Even, R.E. Tarjan, Computing an st-numbering, Theoret. Comput. Sci. 2 (1976) 339-344.
10. J. Hopcroft, R.A. Tarjan, Efficient planarity testing, J. Comput. Mach. 21 (1974) 549-568.
11. B.H. Jackson, Directed graphs and the compaction of IC designs, Contemp. Math. 89 (1989) 107-127
12. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: P. Rosenstiehl (Ed.),Theory of Graphs, Internat. Symp., Rome, July 1966, pp. 215-232.
13. Y.P. Liu, On the linearity of testing planarity of a graph, Combin. Optim. CORR 84-5. University of Waterloo, 1984.
14. Y.P. Liu, A new approach to the linearity of testing planarity of graphs, Acta Math. Appl. Sinica 4 (1988) 257-265.
15. Y. Liu, A. Morgana, B. Simeone, General theoretical results on rectilinear embeddability of graphs, Acta Math. Appl. Sinica 7 (1991) 187-192.
16. Y. Liu, A. Morgana, B. Simeone, A linear algorithm for 3-bend embedding of planar graphs in the grid, Technical Report, Ser. A, no. 1, Dipartimento di Statistica, Probabilità e Statistiche Applicate, Università La Sapienza, Rome, Italy, 1993.
17. Y. Liu, Embeddability in Graphs, Kluwer, Amsterdam, 1995.
18. O. Ore, The Four Colour Problem, Academic Press, New York, 1967.
19. Y. Shiloach, Linear and planar arrangement of graphs, Ph. D. Dissertation, Weizmann Institute, Rehovat, Israel (1976).
20. J.A. Storer, On minimal node-cost planar embeddings, Networks 14 (1984) 181-212.
21. J.L. Szwarcfiter, R. Persiano, A. Oliveira, Orientations with single source and sink, Discrete Appl. Math. 10 (1985) 313-321.
22. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987) 421-444.
23. R. Tamassia, I.G. Tollis, A unified approach to visibility representation of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
24. R. Tamassia, I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits Systems 36 (1989) 1230-1234.
25. R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160
26. L.G. Valiant, Universality Considerations in VLSI, IEEE Trans. Comput. 30 (1981) 135-140.