ASK-GraphView: A Large Scale Graph Visualization System
Authors:
- 20 November 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 12 (5) , 669-676
Abstract
We describe ASK-GraphView, a node-link-based graph visualization system that allows clustering and interactive navigation of large graphs, ranging in size up to 16 million edges. The system uses a scalable architecture and a series of increasingly sophisticated clustering algorithms to construct a hierarchy on an arbitrary, weighted undirected input graph. By lowering the interactivity requirements we can scale to substantially bigger graphs. The user is allowed to navigate this hierarchy in a top down manner by interactively expanding individual clusters. ASK-GraphView also provides facilities for filtering and coloring, annotation and cluster labelingKeywords
This publication has 20 references indexed in Scilit:
- PRISAD: a partitioned rendering infrastructure for scalable accordion drawing2005
- Matrix Zoom: A Visual Interface to Semi-External Graphs2005
- Hierarchical graph mapsComputers & Graphics, 2004
- MGV: a system for visualizing massive multidigraphsIEEE Transactions on Visualization and Computer Graphics, 2002
- Navigating Clustered Graphs Using Force-Directed MethodsJournal of Graph Algorithms and Applications, 2000
- NicheWorks: Interactive Visualization of Very Large GraphsJournal of Computational and Graphical Statistics, 1999
- Navigating hierarchically clustered networks through fisheye and full-zoom methodsACM Transactions on Computer-Human Interaction, 1996
- A hierarchical O(N log N) force-calculation algorithmNature, 1986
- Network structure and minimum degreeSocial Networks, 1983
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972