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
%0 Journal Article
%1 4015416
%A Abello, J.
%A van Ham, F.
%A Krishnan, N.
%D 2006
%J Visualization and Computer Graphics, IEEE Transactions on
%K clustering graph interactive large nodelink visualization
%N 5
%P 669 -676
%R 10.1109/TVCG.2006.120
%T ASK-GraphView: A Large Scale Graph Visualization System
%U http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4015416&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4015416
%V 12
%X 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
@article{4015416,
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 labeling},
added-at = {2012-05-31T18:00:06.000+0200},
author = {Abello, J. and van Ham, F. and Krishnan, N.},
biburl = {https://www.bibsonomy.org/bibtex/2f34e3474164e4215289d12394df2002f/rwoz},
description = {IEEE Xplore - Abstract Page},
doi = {10.1109/TVCG.2006.120},
interhash = {ddf8b01467327cae940a04635e815afa},
intrahash = {f34e3474164e4215289d12394df2002f},
issn = {1077-2626},
journal = {Visualization and Computer Graphics, IEEE Transactions on},
keywords = {clustering graph interactive large nodelink visualization},
month = {sept.-oct. },
number = 5,
pages = {669 -676},
timestamp = {2012-05-31T19:22:28.000+0200},
title = {ASK-GraphView: A Large Scale Graph Visualization System},
url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4015416&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4015416},
volume = 12,
year = 2006
}