ASK-GraphView: A large scale graph visualization system

James Abello; Frank Van Ham; Neeraj Krishnan

doi:10.1109/TVCG.2006.120

ASK-GraphView: A large scale graph visualization system

James Abello, Frank Van Ham, Neeraj Krishnan

School of Arts and Sciences, Computer Science

Research output: Contribution to journal › Article

170 Scopus citations

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.

Original language	English (US)
Pages (from-to)	669-676
Number of pages	8
Journal	IEEE Transactions on Visualization and Computer Graphics
Volume	12
Issue number	5
DOIs	https://doi.org/10.1109/TVCG.2006.120
State	Published - Sep 1 2006

Fingerprint

All Science Journal Classification (ASJC) codes

Software
Signal Processing
Computer Vision and Pattern Recognition
Computer Graphics and Computer-Aided Design

Keywords

Graph clustering
Graph visualization
Information visualization

Cite this

Abello, J., Van Ham, F., & Krishnan, N. (2006). ASK-GraphView: A large scale graph visualization system. IEEE Transactions on Visualization and Computer Graphics, 12(5), 669-676. https://doi.org/10.1109/TVCG.2006.120

@article{73c6bec0512b41c2ad260345a21c15ae,

title = "ASK-GraphView: A large scale graph visualization system",

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.",

keywords = "Graph clustering, Graph visualization, Information visualization",

author = "James Abello and {Van Ham}, Frank and Neeraj Krishnan",

year = "2006",

month = sep,

day = "1",

doi = "10.1109/TVCG.2006.120",

language = "English (US)",

volume = "12",

pages = "669--676",

journal = "IEEE Transactions on Visualization and Computer Graphics",

issn = "1077-2626",

publisher = "IEEE Computer Society",

number = "5",

}

TY - JOUR

T1 - ASK-GraphView

T2 - A large scale graph visualization system

AU - Abello, James

AU - Van Ham, Frank

AU - Krishnan, Neeraj

PY - 2006/9/1

Y1 - 2006/9/1

N2 - 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.

AB - 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.

KW - Graph clustering

KW - Graph visualization

KW - Information visualization

UR - http://www.scopus.com/inward/record.url?scp=33845621411&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845621411&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2006.120

DO - 10.1109/TVCG.2006.120

M3 - Article

C2 - 17080786

AN - SCOPUS:33845621411

VL - 12

SP - 669

EP - 676

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 5

ER -

Access to Document

10.1109/TVCG.2006.120