Graphs, they are changing dynamic graph drawing for a sequence of graphs

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

Volumn 2528 LNCS, Issue , 2002, Pages 23-31

  Diehl, Stephan ^a   Görg, Carsten ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; DRAWING (GRAPHICS); ALGORITHMS; GRAPHIC METHODS;

CHANGING DYNAMICS; FORCE-DIRECTED; GENERIC ALGORITHM; GRAPH LAYOUT; LAYOUT ALGORITHMS; OFFLINE; ON DYNAMICS; PROTOTYPE IMPLEMENTATIONS; DYNAMIC GRAPH DRAWING;

DIRECTED GRAPHS;

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

References (16)

1. U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Computer Science. Springer-Verlag, 1997.
2. Ulrik Brandes. Drawing on physical analogies. In Drawing Graphs [11]. 2001.
3. Jürgen Branke. Dynamic graph drawing. In Drawing Graphs [11]. 2001.
4. S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In Proceedings of 6th International Symposium on Graph Drawing GD'98. Springer LNCS 1457, 1998.
5. R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and st-digraphs. SIAM Journal on Computing, 24(5), 1995.
6. S. Diehl, C. Görg, and A. Kerren. Foresighted Graphlayout. Technical Report A/02/2000, FR 6.2 - Informatik, University of Saarland, December 2000. http://www.cs.uni-sb.de/tr/FB14.
7. Stephan Diehl, Carsten Görg, and Andreas Kerren. Preserving the Mental Map using Foresighted Layout. In Proceedings of Joint Eurographics - IEEE TCVG Symposium on Visualization VisSym'01. Springer Verlag, 2001.
8. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42, 1984.
9. C. Friedrich and M. E. Houle. Graph Drawing in Motion II. In Proceedings of Graph Drawing 2001. Springer LNCS (to appear), 2001.
10. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman and Company, 1979.
11. M. Kaufmann and D. Wagner, editors. Drawing Graphs - Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
12. K.A. Lyons, H. Meijer, and D. Rappaport. Cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1), 1998.
13. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout Adjustment and the Mental Map. Journal of Visual Languages and Computing, 6(2):183-210, 1995.
14. A. Papakostas and I.G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11), 1998.
15. H.C. Purchase, R.F. Cohen, and M. James. Validating graph drawing aesthetics. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Computer Science. Springer-Verlag, 1996.
16. G. Sander. Visualization Techniques for Compiler Construction. Dissertation (in german), University of Saarland, Saarbrücken (Germany), 1996.