Skip to main content
Conference ProceedingsOPEN ACCESS

Dynamic spectral layout of small worlds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3843 LNCS 25-36
DOI: 10.1007/11618058_3
18Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Brandes, U., Fleischer, D., & Puppe, T. (2006). Dynamic spectral layout of small worlds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3843 LNCS, pp. 25–36). https://doi.org/10.1007/11618058_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free