Improved circular layouts

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

Volumn 4372 LNCS, Issue , 2007, Pages 386-398

  Gansner, Emden R ^a   Koren, Yehuda ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMAL SYSTEMS;

CIRCULAR DRAWING STYLE; COMPLEMENTARY TECHNIQUES; READABILITY;

COMPUTER GRAPHICS;

EID: 38349039549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_37     Document Type: Conference Paper

References (21)

1. M. Baur and U. Brandes, "Crossing Reduction in Circular Layouts", Proc. Graph-Theoretic Concepts in Computer-Science (WG '04), 332-343, 2004.
2. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, "An Experimental Comparison of Four Graph Drawing Algorithms", Comput. Geom. Theory Appl. 7, 303-325, 1997.
3. M. Dickerson, D. Eppstein, M. T. Goodrich and J. Meng, "Confluent drawings: Visualizing Non-Planar Diagrams in a Planar Way", Proc. Graph Drawing (GD'03), 1-12, 2003.
4. U. Doǧrusöz, B. Madden and P. Madden, "Circular layout in the Graph Layout Toolkit", Proc. Graph Drawing (GD '96), 92-100, 2003, 1996
5. D. Eppstein, "Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs", Journal of Experimental Algorithmics 5, 1-23, 2000.
6. M. K. Ganapathy and S. Lodha, "On Minimum Circular Arrangement", Proc. 21st Annual Symposium on Theoretical Computer Science (STACS'04), 394-405, 2004.
7. E. R. Gansner, Y. Koren and S. North, "Graph Drawing by Stress Majorization", Proc. Graph Drawing (GD'04), 239-250, 2004.
8. E. R. Gansner and S. North, "An Open Graph Visualization system and its Applications to Software Engineering", Software - Practice & Experience 30, 1203-1233, 2000. Also, www.graphviz.org.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness, Freeman, 1979.
10. K. M. Hall, "An r-dimensional Quadratic Placement Algorithm", Management Science 17, 219-229, 1970.
11. D. Holten and J. J. van Wijk, "Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data", Proc. IEEE Information Visualization (InfoVis'06), to appear.
12. G. Kar, B. Madden and R. S. Gilbert, "Heuristic Layout Algorithms for Network Management Presentation Services", IEEE Network 29-36, 1988.
13. M. Kaufmann and R. Wiese, "Maintaining the Mental Map for Circular Drawings", Proc. Graph Drawing (GD'02), 12-22, 2002.
14. V. Liberatore, "Multicast Scheduling for List Requests", Proc. IEEE INFOCOM 2002, 1129-1137, 2002.
15. S. Masuda, T. Kashiwabara, K. Nakajima and T. Fujisawa, "On the NP-Completeness of a Computer Network Layout Problem", Proc. IEEE International Symposium on Circuits and Systems, 292-295, 1987.
16. F. J. Newbery, "Edge Concentration: A Method for Clustering Directed Graphs", Proc. 2nd Intl. Workshop Software Configuration Management, 76-85, 1989.
17. J. M. Six and I. G. Tollis, "Circular Drawings of Biconnected Graphs", Proc. Algorithms Engineering and Experimentation (ALENEX'99), 57-73, 1999.
18. J. M. Six and I. G. Tollis, "A Framework for Circular Drawings of Networks", Proc. Graph Drawing (GD'99), 107-116, 1999.
19. K. Sugiyama, S. Tagawa and M. Toda, "Methods for Visual Understanding of Hierarchical Systems", IEEE Trans. Systems, Man, and Cybernetics 11, 109-125, 1981.
20. A. Symeonidis and I. G. Tollis, "Visualization of Biological Information with Circular Drawings", Proc. Biological and Medical Data Analysis (ISBMDA'04), 468-478, 2004.
21. W. T. Tutte, "How to Draw a Graph", Proc. London Mathematical Society 13, 743-768, 1963.