The DOI matches its Crossref record.
A Fast Multi-Scale Method for Drawing Large Graphs
Open accessAbstract
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawing of a graph with over 15,000 vertices. Also we achieve "nice" drawings of 1000 vertex graphs in about 1 second. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which was motivated by the earlier multi-scale algorithm of Hadany and Harel []. In principle, it could significantly improve the speed of essentially any force-directed method (regardless of that method's ability of drawing weighted graphs or the continuity of its cost-function).
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
Cited by
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
Holten, D. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.147 · Cited by 970
Force‐Directed Edge Bundling for Graph Visualization
Holten, D., & Van Wijk, J. J. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01450.x · Cited by 522
OpenOrd: an open-source toolbox for large graph layout
Martin, S., Brown, W. M., Klavans, R., & Boyack, K. W. (2011) · SPIE Proceedings · doi:10.1117/12.871402 · Cited by 278
Social media dialogues in a crisis: A mixed-methods approach to identifying publics on social media
Smith, B. G., Smith, S. B., & Knighton, D. (2018) · Public Relations Review · doi:10.1016/j.pubrev.2018.07.005 · Cited by 78
Group-in-a-Box Layout for Multi-faceted Analysis of Communities
Rodrigues, E. M., Milic-Frayling, N., Smith, M., Shneiderman, B., & Hansen, D. (2011) · 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing · doi:10.1109/passat/socialcom.2011.139 · Cited by 57
Metadata
- Authors
- Harel, D., & Koren, Y.
- Venue
- Journal of Graph Algorithms and Applications
- Published
- 2002
- Volume
- 6
- Issue
- 3
- Pages
- 179-202
- ISSN
- 1526-1719 (ISSN-L)
- OpenAlex
- W2000856020
- Cited by
- 169
- References
- 0
- FWCI
- 10.11
- Type
- journal article
- Language
- en
- Open access
- diamond
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: A Fast Multi-Scale Method for Drawing Large Graphs. https://app.cochat.ai/papers/10.7155/jgaa.00051
- The paper
- Harel, D., & Koren, Y. (2002). A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications. https://doi.org/10.7155/jgaa.00051
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.