Maintaining the mental map for circular drawings

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

Volumn 2528 LNCS, Issue , 2002, Pages 12-22

  Kaufmann, Michael ^a   Wiese, Roland ^a,b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b Works GmbH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

BICONNECTED COMPONENTS; BRANDENBURG; GRAPH CLUSTERING; MENTAL MAPS; SERIES-PARALLEL GRAPH; SINGLE VERTEX; STAR-LIKE; USER INTERACTION;

TREES (MATHEMATICS);

EID: 79960196662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_2     Document Type: Conference Paper

References (20)

1. Booth, K.S. and Lueker G.S., Testing for the consecutive ones property, intervals graphs and graph planarity testing using PQ-tree algorithms, J. Comput. System Sci.13, pp. 335-379, 1976.
2. Brandenburg F., Graph Clustering 1: Cycles of Cliques, Proc. GD'97, LNCS 1353, Springer, pp. 158-168, 1998.
3. Branke J., Dynamic Graph Drawing, in Kaufmann/Wagner (Eds.) Drawing Graphs: Methods and Models, LNCS 2025, Springer, pp. 228-246, 2001.
4. Brockenauer R. and S. Cornelsen, Drawing Clusters and Hierarchies, in Kaufmann/Wagner (Eds.) Drawing Graphs: Methods and Models, LNCS 2025, Springer, pp. 193-227, 2001.
5. Di Battista, G., Eades P., Tamassia R. and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, 1999.
6. Di Battista G., and Tamassia R., On-line graph algorithms with SPQR-trees, Proc. ICALP 1990, LNCS 442, Springer, pp. 598-611, 1990.
7. Dogrusöz U., B. Madden and P. Madden, Circular Layout in the Graph Layout Toolkit, Proc. GD'96, LNCS 1190, Springer, pp. 92-100, 1997.
8. Duncan Ch., Goodrich M., and Kobourov St., Planarity-Preserving Clustering and Embedding of Large Graphs, Proc. GD'99, LNCS 1731, Springer, pp. 186-196, 2000.
9. Eades P., Drawing Free Trees, Bulletin of the Institute for Combinatorics and its Applications, 5, pp. 10-36, 1992.
10. Edachery, J., Sen A., Brandenburg F., Graph Clustering Using Distance-k Cliques, Proc. GD'99, LNCS 1731, Springer, pp. 98-106, 2000.
11. Kar G., B. Madden and R. Gilbert, Heuristic Layout Algorithms for Network Presentation Services, IEEE Network, 11, pp. 29-36, 1988.
12. Krebs V., Visualizing Human Networks, Release 1.0: Esther Dyson's Monthly Report, pp. 1-25, 1996.
13. Lengauer T., Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner, 1990.
14. Six, J.M. and I.G. Tollis, Circular Drawings of Biconnected Graphs, Proc. Alenex'99, LNCS 1619, Springer, pp. 57-73, 1999.
15. Six, J.M. and I.G. Tollis, A Framework for Circular Drawings of Networks, Proc. GD'99, LNCS 1731, Springer, pp. 107-116, 2000.
16. Six, J.M., Ph.D. Thesis, University of Texas at Dallas, 2000.
17. Sugiyama K., S. Tagawa and M. Toda. Methods for Visual Understanding of Hierarchical System Structures, IEEE Transactions on Systems, Man and Cybernetics, 11(2), pp. 109-125, 1981.
18. Sugiyama K., K. Misue. Visualisation of structural information: Automatic drawing of compound digraphs, IEEE Transactions on Systems, Man and Cybernetics, 21(4), pp. 876-892, 1991.
19. The yFiles library: http://www-pr.informatik.uni-tuebingen.de/yfiles/
20. and http://www.yworks.de