A Framework for Circular Drawings of Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1731, Issue , 1999, Pages 107-116

  Six, Janet M ^a   Tollis, Ioannis G ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BICONNECTIVITY; NETWORK DESIGN; STATE OF THE ART;

DRAWING (GRAPHICS);

EID: 84958967819     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_11     Document Type: Conference Paper

References (17)

1. M. A. Bernard, On the Automated Drawing of Graphs, Proc. 3rd Caribbean Conf. on Combinatorics and Computing, pp. 43-55, 1994.
2. F. Brandenburg, Graph Clustering 1: Cycles of Cliques, Proc. GD '97, Rome, Italy, Lecture Notes in Computer Science 1353, Springer-Verlag, pp. 158-168, 1998.
3. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, 4(5), pp. 235-282, 1994. Also available at http://www.utdallas.edu/~tollis.
4. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, Englewood Cliffs, NJ, 1999.
5. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu and L. Vismara, An Experimental Comparison of Four Graph Drawing Algorithms, Computational Geometry: Theory and Applications, 7(5-6), pp.303-26, 1997. Also available at http://www.cs.brown.edu/people/rt.
6. U. Doğrusöz, B. Madden and P. Madden, Circular Layout in the Graph Layout Toolkit, Proc. GD '96, Berkeley, California, Lecture Notes in Computer Science 1190, Springer-Verlag, pp. 92-100, 1997.
7. P. D. Eades, Drawing Free Trees, Bulletin of the Institute for Combinatorics and its Applications, 5, pp. 10-36, 1992.
8. C. Esposito, Graph Graphics: Theory and Practice, Comput. Math. Appl., 15(4), pp.247-253, 1988.
9. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
10. G. Kar, B. Madden and R. Gilbert, Heuristic Layout Algorithms for Network Presentation Services, IEEE Network, 11, pp. 29-36, 1988.
11. A. Kershenbaum, Telecommunications Network Design Algorithms, McGraw-Hill, 1993.
12. V. Krebs, Visualizing Human Networks, Release 1.0: Esther Dyson's Monthly Report, pp. 1-25, February 12, 1996.
13. S. Masuda, T. Kashiwabara, K. Nakajima and T. Fujisawa, On the NPCompleteness of a Computer Network Layout Problem, Proc. IEEE 1987 International Symposium on Circuits and Systems, Philadelphia, PA, pp.292-295, 1987.
14. S. Mitchell, Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs, Information Processing Letters, 9(5), pp. 229-232, 1979.
15. J. M. Six and I. G. Tollis, Circular Drawings of Biconnected Graphs, Proc. of ALENEX '99, Baltimore, MD, To appear, 1999.
16. J. M. Six and I. G. Tollis, Algorithms for Drawing Circular Visualizations of Networks, Manuscript, 1999.
17. I. G. Tollis and C. Xia, Drawing Telecommunication Networks, Proc. GD '94, Princeton. New Jersey, Lecture Notes in Computer Science 894, Springer-Verlag, pp. 206-217, 1994.