Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 483

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

Drawing graphs nicely using simulated annealing

Open access
Davidson, Ron, Harel, David·1996·ACM Transactions on Graphics

Abstract

The paradigm of simulated annealing is applied to the problem of drawing graphs “nicely.” Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights of the criteria can be changed. For graphs of modest size it produces good results, competitive with those produced by other methods, notably, the “spring method” and its variants.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/234535.234538

Cites

15 of 15 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 15 references

Research works printed but not linked: 14

  1. BERNARD , M. A. 1981 . On the automated drawing of graphs . In Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing, 43-55 .]] BERNARD, M. A. 1981. On the automated drawing of graphs. In Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing, 43-55.]]
  2. 10.1016/0164-1212(84)90006-2 · doi:10.1016/0164-1212(84)90006-2
  3. 10.1002/spe.4380181104 · doi:10.1002/spe.4380181104
  4. 10.1137/0604033 · doi:10.1137/0604033
  5. 10.1109/32.54292 · doi:10.1109/32.54292
  6. 10.1006/jvlc.1995.1014 · doi:10.1006/jvlc.1995.1014
  7. 10.1109/32.60298 · doi:10.1109/32.60298
  8. 10.5555/85867.85882 · doi:10.5555/85867.85882
  9. 10.1002/jgt.3190110306 · doi:10.1002/jgt.3190110306
  10. KAMADA , T. 1989. Visualizing Abstract Objects and Relations. World Scientific , Teaneck, N.J., (See also On visualization of abstract objects and relations. D. Sc. Thesis , The University of Tokyo , Dec. 1988 .)]] KAMADA, T. 1989. Visualizing Abstract Objects and Relations. World Scientific, Teaneck, N.J., (See also On visualization of abstract objects and relations. D. Sc. Thesis, The University of Tokyo, Dec. 1988.)]]
  11. 10.1080/00207169008803875 · doi:10.1080/00207169008803875
  12. MANNING , g. AND ATA LLAH , M.g. 1988 . Fast detection and display of symmetry in trees . Cong. Numer. 64 , 159 - 169 .]] MANNING, g. AND ATALLAH, M.g. 1988. Fast detection and display of symmetry in trees. Cong. Numer. 64, 159-169.]]
  13. 10.1109/TCAD.1987.1270265 · doi:10.1109/tcad.1987.1270265
  14. 10.1109/21.87055 · doi:10.1109/21.87055

Cited by

See all 483

Metadata

Authors
Davidson, R., & Harel, D.
Venue
ACM Transactions on Graphics
Published
1996-10
Volume
15
Issue
4
Pages
301-331
ISSN
  • 0730-0301 (ISSN-L)
  • 1557-7368
OpenAlex
W2021053884
Cited by
483
References
15
FWCI
28.99
Type
journal article
Language
en
Open access
bronze

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: Drawing graphs nicely using simulated annealing. https://app.cochat.ai/papers/10.1145/234535.234538
The paper
Davidson, R., & Harel, D. (1996). Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics. https://doi.org/10.1145/234535.234538

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.