ASK-GraphView: A Large Scale Graph Visualization System

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 labeling

[1]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[2]  Saul Greenberg,et al.  Navigating hierarchically clustered networks through fisheye and full-zoom methods , 1996, TCHI.

[3]  Michael Fröhlich,et al.  Demonstration of the Interactive Graph-Visualization System da Vinci , 1994, GD.

[4]  James Abello,et al.  Matrix Zoom: A Visual Interface to Semi-External Graphs , 2004, IEEE Symposium on Information Visualization.

[5]  Tamara Munzner,et al.  TopoLayout: Graph Layout by Topological Features , 2005 .

[6]  David Harel,et al.  Drawing Huge Graphs by Algebraic Multigrid Optimization , 2003, Multiscale Model. Simul..

[7]  James Abello,et al.  Hierarchical graph maps , 2004, Comput. Graph..

[8]  Tamara Munzner,et al.  PRISAD: A Partitioned Rendering Infrastructure for Scalable Accordion Drawing (Extended Version) , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[9]  Graham J. Wills.  NicheWorks—Interactive Visualization of Very Large Graphs , 1999 .

[10]  Tamara Munzner,et al.  H3: laying out large directed graphs in 3D hyperbolic space , 1997, Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium.

[11]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[12]  S. Dongen.  Graph clustering by flow simulation , 2000 .

[13]  Philippe Castagliola,et al.  On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis , 2005, Inf. Vis..

[14]  James Abello,et al.  MGV: A System for Visualizing Massive Multidigraphs , 2002, IEEE Trans. Vis. Comput. Graph..

[15]  Peter Eades,et al.  Multilevel Visualization of Clustered Graphs , 1996, GD.

[16]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

[17]  Jarke J. van Wijk,et al.  Interactive Visualization of Small World Graphs , 2004, IEEE Symposium on Information Visualization.

[18]  Yehuda Koren,et al.  Topological fisheye views for visualizing large graphs , 2004, IEEE Transactions on Visualization and Computer Graphics.

[19]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[20]  Vladimir Batagelj,et al.  Pajek - Analysis and Visualization of Large Networks , 2001, Graph Drawing Software.

[21]  David Auber,et al.  Tulip - A Huge Graph Visualization Framework , 2004, Graph Drawing Software.