A better heuristic for orthogonal graph drawings

Computational Geometry: Theory and Applications

Volumn 9, Issue 3, 1998, Pages 159-180

  Biedl, Therese ^a   Kant, Goos ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008999702     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00026-6     Document Type: Article

References (27)

1. T. Biedl, New lower bounds for orthogonal graph drawing, in: Proc. Graph Drawing '95, Lecture Notes in Computer Science 1027, Springer, Berlin, 1996, pp. 28-39.
2. T. Biedl, Optimal orthogonal drawings of triconnected plane graphs, in: Proc. Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 1097, Springer, Berlin, 1996, pp. 333-344.
3. T. Biedl, Improved orthogonal drawings of 3-graphs, in: Fiala, Kranakis, Sack (eds.), Proc. 8th Canadian Conference on Computational Geometry, International Informatics Series 5, Carleton University Press, 1996, pp. 295-299.
4. T. Biedl, Optimal orthogonal drawings of connected plane graphs, in: Fiala, Kranakis, Sack (eds.), Proc. 8th Canadian Conference on Computational Geometry, International Informatics Series 5, Carleton University Press, 1996, pp. 306-311.
5. N. Chiba, T. Nishizeki, S. Abe, T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci. 30 (1985) 54-76.
6. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for automatic graph drawing: an annotated bibliography, Computational Geometry: Theory and Applications 4 (5) (1994) 235-282.
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu, An experimental comparison of four graph drawing algorithms, Computational Geometry: Theory and Applications 7 (5-6) (1997) 303-325.
8. P.F. Dietz, D.D. Sleator, Two algorithms for maintaining order in a list, in: Proc. 19th Annual ACM Symp. Theory of Computing, 1987, pp. 365-372.
9. S. Even, G. Granot, Rectilinear planar drawings with few bends in each edge, Manuscript, Faculty of Comp. Science, the Technion, Haifa, Israel, 1993.
10. S. Even, R.E. Tarjan, Computing an st-numbering, Theoret. Comput. Sci. 2 (1976) 436-441.
11. M. Formann, F. Wagner, The VLSI layout problem in various embedding models, in: Graph-Theoretic Concepts in Comp. Science (16th Workshop WG '90), Springer, Berlin, 1992, pp. 130-139.
12. U. Fößmeier, M. Kaufmann, Drawing high degree graphs with low bend numbers, in: Proc. Graph Drawing '95, Lecture Notes in Computer Science 1027, Springer, Berlin, 1996, pp. 254-266.
13. A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, in: Proc. Graph Drawing '94, Lecture Notes in Computer Science 894, Springer, Berlin, 1995, pp. 286-297.
14. A. Garg, R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, in: Proc. Graph Drawing '96, Lecture Notes in Computer Science 1190, Springer, Berlin, 1997, pp. 201-216.
15. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica 16 (1996) 4-32.
16. M.R. Kramer, J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits, in: F.P. Preparata (ed.), Advances in Computer Research, Vol. 2: VLSI Theory, JAI Press, Reading, MA, 1984, pp. 129-146.
17. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: Theory of Graphs, Internat. Symp. Rome, 1966, pp. 215-232.
18. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Teubner/Wiley, Stuttgart/Chichester, 1990.
19. Y. Liu, A. Morgana, B. Simeone, General theoretical results on rectilinear embeddability of graphs, Acta Math. Appl. Sinica 7 (1991) 187-191.
20. B. Madden, P. Madden, S. Powers, M. Himsolt, Portable graph layout and editing, in: Proc. Graph Drawing '95, Lecture Notes in Computer Science 1024, Springer, Berlin, 1996, pp. 385-395.
21. A. Papakostas, I.G. Tollis, A pairing technique for area-efficient orthogonal drawings, in: Proc. Graph Drawing '96, Lecture Notes in Computer Science 1190, Springer, Berlin, 1997, pp. 355-370.
22. M. Schäffter, Drawing graphs on rectangular grids, Discrete Appl. Math. 63 (1995) 75-89.
23. J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984) 181-212.
24. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987) 421-444.
25. R. Tamassia, I.G. Tollis, Efficient embedding of planar graphs in linear time, in: Proc. IEEE Internat. Symp. on Circuits and Systems, Philadelphia, 1987, pp. 495-498.
26. R. Tamassia, I.G. Tollis, J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inform. Process. Lett. 39 (1991) 35-40.
27. L.G. Valiant, On non-linear lower bounds in computational complexity, in: Proc. 7th Symp. on Theory of Computing, 1975, pp. 45-53.