CoChat

Graph drawing by force‐directed placement

Fruchterman, Thomas M. J., Reingold, Edward M. · 1991 · Software: Practice and Experience

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Abstract

We present a modification of the spring‐embedder model of Eades [Congressus Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.

Overview

Integrity signals

Registry

Crossref · 10.1002/spe.4380211102

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 19 references

Research works printed but not linked: 5

  1. Tipler P. A., 1982, Physics
  2. Kamada T., 1988, Technical Report 88–007
  3. Hearn D., 1986, Computer Graphics
  4. Breuer M. A., 1977, Min‐cut placement, Journal of Design Automation and Fault Tolerant Computing, 1, 343
  5. Dewhurst S. C., 1989, Programming in C++

Cited by

Items 801–900 of 1,021

Metadata

Authors
Fruchterman, T. M. J., & Reingold, E. M.
Affiliations
University of Illinois Urbana-Champaign (US)
Venue
Software: Practice and Experience
Publisher
Wiley
Published
1991-11
Volume
21
Issue
11
Pages
1129-1164
ISSN
  • 0038-0644 (ISSN-L)
  • 1097-024X
OpenAlex
W2167482691
Cited by
6,352
References
19
Citations by year
2026: 283 · 2025: 430 · 2024: 451 · 2023: 474 · 2022: 425 · 2021: 442 · 2020: 456 · 2019: 331 · 2018: 313 · 2017: 290 · 2016: 284 · 2015: 275 · 2014: 246 · 2013: 238 · 2012: 225
FWCI
5.14
Type
journal article
Language
en
Open access
closed
Locations
Software Practice and Experience (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
Keywords
network visualization, force-directed placement, undirected graphs, graph layout algorithms

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

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.