Dynamic Spectral Layout with an Application to Small Worlds

Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models. Article Type Communicated by Submitted Revised Regular paper P. Eades and P. Healy January 2006 January 2007 U. Brandes et al., Dynamic Spectral Layout , JGAA, 11(2) 325–343 (2007) 326

[1]  Stephen G. Kobourov,et al.  Intersection-Free Morphing of Planar Graphs , 2003, GD.

[2]  Y. Koren,et al.  Drawing graphs by eigenvectors: theory and practice , 2005 .

[3]  Stephan Diehl,et al.  Preserving the Mental Map using Foresighted Layout , 2001, VisSym.

[4]  Stephen G. Kobourov,et al.  GraphAEL: Graph Animations with Evolving Layouts , 2003, GD.

[5]  Robert F. Cohen,et al.  Online Animated Graph Drawing for Web Navigation , 1997, GD.

[6]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Graph Drawing in Motion , 2022 .

[7]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[8]  Roberto Tamassia,et al.  Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms , 2000, J. Graph Algorithms Appl..

[9]  Ulrik Brandes,et al.  Dynamic WWW Structures in 3D , 2000, J. Graph Algorithms Appl..

[10]  Ulrik Brandes,et al.  A Bayesian Paradigm for Dynamic Graph Layout , 1997, GD.

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  Carsten Friedrich,et al.  Graph Drawing in Motion II , 2001, GD.

[13]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[14]  Franz Rellich,et al.  Perturbation Theory of Eigenvalue Problems , 1969 .

[15]  David Harel,et al.  Drawing Huge Graphs by Algebraic Multigrid Optimization , 2003, Multiscale Model. Simul..

[16]  Jürgen Branke,et al.  Dynamic Graph Drawing , 2001, Drawing Graphs.

[17]  Ulrik Brandes,et al.  Sketch-Driven Orthogonal Graph Drawing , 2002, GD.

[18]  Giuseppe Liotta,et al.  Infinite Trees and the Future , 1999, GD.

[19]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .