Sciweavers

JGAA
2007
88views more  JGAA 2007»
13 years 11 months ago
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 principl...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe
GD
2005
Springer
14 years 5 months ago
Dynamic Spectral Layout of Small Worlds
Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some gen...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe
ACSC
2005
IEEE
14 years 5 months ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai