Title
Laplacian-based dynamic graph visualization
Abstract
Visualizing dynamic graphs are challenging due to the difficulty to preserving a coherent mental map of the changing graphs. In this paper, we propose a novel layout algorithm which is capable of maintaining the overall structure of a sequence graphs. Through Laplacian constrained distance embedding, our method works online and maintains the aesthetic of individual graphs and the shape similarity between adjacent graphs in the sequence. By preserving the shape of the same graph components across different time steps, our method can effectively help users track and gain insights into the graph changes. Two datasets are tested to demonstrate the effectiveness of our algorithm.
Year
DOI
Venue
2015
10.1109/PACIFICVIS.2015.7156358
IEEE Pacific Visualization Symposium
Keywords
Field
DocType
dynamic graph, graph layout algorithm, Laplican matrix, force directed layout, stress model
Graph theory,Graph drawing,Graph operations,Modular decomposition,Computer science,Theoretical computer science,Graph product,Clique-width,1-planar graph,Topological graph theory
Conference
ISSN
Citations 
PageRank 
2165-8765
3
0.38
References 
Authors
19
6
Name
Order
Citations
PageRank
Limei Che130.38
Jie Liang28610.85
Xiaoru Yuan3115770.28
Jianping Shen430.38
Jinquan Xu530.38
Yong Li640.74