A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering

Volumn 19, Issue 3, 1993, Pages 214-230

  Gansner, Emden R ^a   Koutsofios, Eleftherios ^a   North, Stephen C ^a   Vo, Kiem Phong ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Directed graph layout algorithm; network simplex

Indexed keywords

COMPUTER SOFTWARE; DRAWING (GRAPHICS); GRAPHIC METHODS; INTERACTIVE COMPUTER SYSTEMS;

GRAPH LAYOUT; INTERACTIVE DRAWING; NETWORK SIMPLEX;

COMPUTER GRAPHICS;

EID: 0027553807     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.221135     Document Type: Article

References (20)

1. E. R. Gansner, S. C. North, and K.-P. Vo, “DAG—A program that draws directed graphs,” Software—Practice and Experience., vol. 17. no. 1., pp. 1047–1062, 1988.
2. P. Eades and R. Tamassia, “Algorithms for automatic graph drawing: an annotated bibliography,” Tech. Rep. CS-89-09 (Revised Version), Brown University, Department of Computer Science, Providence RI, Oct. 1989.
3. J. Warfield, “Crossing theory and hierarchy mapping,” IEEE Trans. Syst. Man Cybern., vol. SMC-7 no. 7, pp. 505–523, July 1977.
4. M. Carpano, “Automatic display of hierarchized graphs for computer aided decision analysis,” IEEE Trans. Software Eng., vol. SE-12, no. 4, pp. 538–546, 1980.
5. K. S. Sugiyama, S. Tagawa, and M. Toda, “Methods for visual understanding of hierarchical system structures,” IEEE Trans. Syst. Man, Cybern, vol. SMC-11, no. 2, pp. 109–125, Feb. 1981.
6. G. Di Battista, and R. Tamassia, “Algorithms for plane representations of acyclic digraphs,” Theoretical Computer Sci. vol. 61, pp. 175–198, 1988.
7. E. Koutsofios and S. North, “Drawing graphs with dot,” Tech. Rep. (available from the authors), AT&T Bell Laboratories, Murray Hill NJ, 1992.
8. L. A. Rowe, M. Davis, E. Messinger, C. Meyer, C. Spirakis, and A. Tuan, “A browser for directed graphs,” Software—Practice and Experience, vol. 17. no. 1, pp. 61–76, Jan. 1987.
9. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
10. P. Eades, B. McKay, and N. Wormald, “On an edge crossing problem,” in Proc. 9th Australian Computer Science Conf., 1986, pp. 327–334.
11. R. Garey, and D. S. Johnson, Computers and Intractability. San Francisco: W. H. Freeman, 1979.
12. G. Robbins, “The ISI grapher, a portable tool for displaying graphs pictorially,” Symboliikka ’87, Helsinki, Finland, also Tech. Rep. IST/RS-87-196, Information Sciences Institute, Marina Del Rey, CA.
13. A. V. Goldberg, and R. E. Tarjan, “Finding minimum-cost circulations by successive approximation,” Mathematics of Operations Res., vol. 15, no. 3, pp. 430–466, 1990.
14. E. R. Gansner, S. C. North, and K.-P. Vo, “On the rank assignment problem,” to be submitted.
15. V. Chvatal, Linear Programming. New York: W. H. Freeman, 1983.
16. W. H. Cunningham, “A network simplex method,” Mathematical Programming, vol. 11, pp. 105–116, 1976.
17. P. Eades and N. Wormald, “The median heuristic for drawing 2-layers networks,” Tech. Rep. 69, Dept. of Computer Science, University of Queensland, 1986.
18. S. Suri, “A linear time algorithm for minimum link paths inside a simple polygon,” Computer Vision, Graphics, and Image Processing, vol. 35, pp. 99–110, 1986.
19. A. S. Glassner Ed., Graphics Gems. San Diego: Academic Press, 1990.
20. H. Freeman, and J. Ahn, “On the problem of placing names in a geographic map,” Int. J. Pattern Recognition and Artificial Intell., vol. 1, no. 1. pp. 121–140, 1987.