DOI: 10.7155/jgaa.00149
Dynamic Spectral Layout with an Application to Small Worlds
Ulrik Brandes , Daniel Fleischer , and Thomas Puppe
Vol. 11, no. 2, pp. 325-343, 2007. Regular paper

Abstract 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.
Submitted: January 2006.
Revised: January 2007.
Communicated by Peter Eades and Patrick Healy


Journal of Graph Algorithms and Applications