The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
ASK-GraphView: A Large Scale Graph Visualization System
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
WordNet: An Electronic Lexical Database
(1998) · The MIT Press eBooks · doi:10.7551/mitpress/7287.001.0001 · Cited by 4,857
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
Network structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
Graph Clustering by Flow Simulation
van Dongen, S. M. (2000) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 1,595
Pajek— Analysis and Visualization of Large Networks
Batagelj, V., & Mrvar, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45848-4_54 · Cited by 708
Pajek — Analysis and Visualization of Large Networks
Batagelj, V., & Mrvar, A. (2004) · Mathematics and Visualization · doi:10.1007/978-3-642-18638-7_4 · Cited by 330
Navigating hierarchically clustered networks through fisheye and full-zoom methods
Schaffer, D., Zuo, Z., Greenberg, S., Bartram, L., Dill, J., Dubs, S., & Roseman, M. (1996) · ACM Transactions on Computer-Human Interaction · doi:10.1145/230562.230577 · Cited by 232
Multilevel visualization of clustered graphs
Eades, P., & Feng, Q.-W. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62495-3_41 · Cited by 204
Interactive Visualization of Small World Graphs
van Ham, F., & van Wijk, J. J. (2005) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.2004.43 · Cited by 170
Self-citation
Cited by
Hierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines
Elmqvist, N., & Fekete, J.-D. (2010) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.84 · Cited by 381
Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow
Wongsuphasawat, K., Smilkov, D., Wexler, J., Wilson, J., Mane, D., Fritz, D., Krishnan, D., Viegas, F. B., & Wattenberg, M. (2018) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2744878 · Cited by 331
Western University, Sedig, K., Parsons, P., & Western University (2013) · AIS Transactions on Human-Computer Interaction · doi:10.17705/1thci.00055 · Cited by 145
A Framework of Interaction Costs in Information Visualization
Lam, H. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.109 · Cited by 133
Abello, J., Broadwell, P., & Tangherlini, T. R. (2012) · Communications of the ACM · doi:10.1145/2209249.2209267 · Cited by 70
Self-citation
Metadata
- Authors
- Abello, J., van Ham, F., & Krishnan, N.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2006-09
- Volume
- 12
- Issue
- 5
- Pages
- 669-676
- ISSN
- 1077-2626 (ISSN-L)
- 1941-0506
- 2160-9306
- OpenAlex
- W2131548207
- Cited by
- 272
- References
- 14
- FWCI
- 12.15
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ASK-GraphView: A Large Scale Graph Visualization System. https://app.cochat.ai/papers/10.1109/tvcg.2006.120
- The paper
- Abello, J., van Ham, F., & Krishnan, N. (2006). ASK-GraphView: A Large Scale Graph Visualization System. IEEE Transactions on Visualization and Computer Graphics. https://doi.org/10.1109/tvcg.2006.120
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.