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 accessAbstract
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
de Boor, C. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-6333-3 · Cited by 11,944
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
An algorithm for drawing general undirected graphs
Kamada, T., & Kawai, S. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90102-6 · Cited by 2,698
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Harel, D. (1988) · Communications of the ACM · doi:10.1145/42411.42414 · Cited by 1,269
Self-citationEades, P. (1984) · Congressus Numerantium · Cited by 1,147
Research works printed but not linked: 14
- 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.]]
- 10.1016/0164-1212(84)90006-2 · doi:10.1016/0164-1212(84)90006-2
- 10.1002/spe.4380181104 · doi:10.1002/spe.4380181104
- 10.1137/0604033 · doi:10.1137/0604033
- 10.1109/32.54292 · doi:10.1109/32.54292
- 10.1006/jvlc.1995.1014 · doi:10.1006/jvlc.1995.1014
- 10.1109/32.60298 · doi:10.1109/32.60298
- 10.5555/85867.85882 · doi:10.5555/85867.85882
- 10.1002/jgt.3190110306 · doi:10.1002/jgt.3190110306
- 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.)]]
- 10.1080/00207169008803875 · doi:10.1080/00207169008803875
- 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.]]
- 10.1109/TCAD.1987.1270265 · doi:10.1109/tcad.1987.1270265
- 10.1109/21.87055 · doi:10.1109/21.87055
Cited by
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Jacomy, M., Venturini, T., Heymann, S., & Bastian, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0098679 · Cited by 2,909
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
Network analysis of 2-mode data
Borgatti, S. P., & Everett, M. G. (1997) · Social Networks · doi:10.1016/s0378-8733(96)00301-2 · Cited by 1,128
Moody, J., McFarland, D., & Bender‐deMoll, S. (2005) · American Journal of Sociology · doi:10.1086/421509 · Cited by 493
Cauchemez, S., Bhattarai, A., Marchbanks, T. L., Fagan, R. P., Ostroff, S., Ferguson, N. M., Swerdlow, D., the Pennsylvania H1N1 working group, Sodha, S. V., Moll, M. E., et al. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1008895108 · Cited by 369
Mining communities and their relationships in blogs: A study of online hate groups
Chau, M., & Xu, J. (2007) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2006.08.009 · Cited by 323
Network Visualization by Semantic Substrates
Shneiderman, B., & Aris, A. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.166 · Cited by 293
Geometry-Based Edge Clustering for Graph Visualization
Cui, W., Zhou, H., Qu, H., Wong, P. C., & Li, X. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.135 · Cited by 283
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
Functional interpretation of single cell similarity maps
DeTomaso, D., Jones, M. G., Subramaniam, M., Ashuach, T., Ye, C. J., & Yosef, N. (2019) · Nature Communications · doi:10.1038/s41467-019-12235-0 · Cited by 264
Modularity clustering is force-directed layout
Noack, A. (2009) · Physical Review E · doi:10.1103/physreve.79.026102 · Cited by 258
Barsky, A., Gardy, J. L., Hancock, R. E. W., & Munzner, T. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm057 · Cited by 175
igraph 1.0 enables fast and robust network analysis across programming languages
Antonov, M., Csárdi, G., Horvát, S., Müller, K., Nepusz, T., Noom, D., Salmon, M., Traag, V., Welles, B. F., & Zanini, F. (2026) · PLOS One · doi:10.1371/journal.pone.0355108 · Cited by 56
“Graph layout algorithms include Fruchterman-Reingold, multidimensional scaling [32], the Large Graph Layout [33], Davidson-Harel [34], the GEM layout [35], Kamada-Kawai, and an implementation of Uniform Mani-fold Approximation and Projection (UMAP) [27] that does not depend on cross-language…”
Combining hierarchy and energy for drawing directed graphs
Carmel, L., Harel, D., & Koren, Y. (2004) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2004.1260757 · Cited by 34
Self-citation
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
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.