Dynamic spectral layout of small worlds

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

Volumn 3843 LNCS, Issue , 2006, Pages 25-36

  Brandes, Ulrik ^a   Fleischer, Daniel ^a   Puppe, Thomas ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NUMERICAL ANALYSIS; SPECTRUM ANALYZERS;

GRAPH LAYOUT; SMALL-WORLD MODELS; SPECTRAL METHODS;

GRAPH THEORY;

EID: 33745662403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_3     Document Type: Conference Paper

References (19)

1. U. Brandes, M. Eiglsperger, M. Kaufmann, and D. Wagner, Sktech-driven orthogonal graph drawing. In Proc. G D 2002, LNCS 2528, pages 1-11. Springer, 2002.
2. U. Brandes, V. Kääb, A. Löh, D. Wagner, and T. Willhalm. Dynamic WWW structures in 3D. Journal of Graph Algorithms and Applications, 4(3):103-114, 2000.
3. U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Proc. GD 1997, LNCS 1353, pages 236-247. Springer, 1997.
4. J. Branke. Dynamic graph drawing. In M. Kaufmann and D. Wagner, editors, Drawing Graphs, LNCS 2025, pages 228-246. Springer, 2001.
5. S. Bridgeman and R. Tamassia, Difference metrics for interactive orthogonal graph drawing algorithms. Journal of Graph Algorithms and Applications, 4(3):47-74, 2000.
6. C. Demestrescu, G. Di Battista, I. Finocchi, G. Liotta, M. Patrignani, and M. Pizzonia. Infinite trees and the future. In Proc. GD 1999, LNCS 1731, pages 379-391. Springer, 1999.
7. S. Diehl, C. Görg, and A. Kerren. Preserving the mental map using forsighted layout. In Proc. VisSym 2001. Springer, 2001.
8. P. Eades, R. F. Cohen, and M. Huang. Online animated graph drawing for web navigation. In Proc. GD 1997, LNCS 1353, pages 330-335. Springer, 1997.
9. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee. GraphAEL: Graph animations with evolving layouts. In Proc. GD 2003, LNCS 2912, pages 98-110. Springer, 2003.
10. C. Erten, S. G. Kobourov, and C. Pitta. Intersection-free morphing of planar graphs. In Proc. G D 2003, LNCS 2912, pages 320-331. Springer, 2003.
11. C. Friedrich and P. Eades. Graph drawing in motion. Journal of Graph Algorithms and Applications, 6(3):353-370, 2002.
12. C. Friedrich and M. E. Houle. Graph drawing in motion II. In Proc. GD 2001, LNCS 2265, pages 220-231. Springer, 2001.
13. G. H. Golub and C. F. van Loan. Matrix Computations, John Hopkins University Press, 1983.
14. K. M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17(3):219-229, 1970.
15. Y. Koren. Drawing graphs by eigenvectors: Theory and practice. Computers and Mathematics with Applications, 2005. To appear.
16. Y. Koren, L. Carmel, and D. Harel. Drawing huge graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation, 1(4):645-673, 2003.
17. 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.
18. F. Rellich. Perturbation Theory of Eigenvalue Problems. Gordon and Breach Science Publishers, 1969.
19. D. J. Watts and S. H. Strogatz. Collective dynamics of "small-world" networks. Nature, 393:440-442, 1998.