The DOI matches its Crossref record.
An algorithm for drawing general undirected graphs
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
No references could be resolved yet.
Research works printed but not linked: 16
- Batini, 1986, A layout algorithm for data flow diagrams, IEEE Trans. Software Eng., SE-12, 538, 10.1109/TSE.1986.6312901 · DOI
- Becker, 1987, On the optimal layout of planar graphs with fixed boundary, SIAM J. Comput., 16, 946, 10.1137/0216061 · DOI
- Carpano, 1980, Automatic display of hierarchized graphs for computer-aided decision analysis, IEEE Trans. Syst., Man, Cybern., SMC-10, 705, 10.1109/TSMC.1980.4308390 · DOI
- Corneil, 1970, An efficient algorithm for graph isomorphism, J. ACM, 17, 51, 10.1145/321556.321562 · DOI · Paper page
- Eades, 1984, A heuristics for graph drawing, Congr. Numer., 42, 149
- Floyd, 1962, Algorithm 97: shortest path, Comm. ACM, 5, 345, 10.1145/367766.368168 · DOI · Paper page
- Hopcroft, 1973, A V log V algorithm for isomorphism of triconnected of planar graphs, J. Comput. Syst. Sci., 7, 323, 10.1016/S0022-0000(73)80013-3 · DOI
- Lipton, 1985, A method for drawing graphs, Proc. ACM Symposium on Computational Geometry, 153, 10.1145/323233.323254 · DOI
- Mittal, 1988, A fast backtrack algorithm for graph isomorphism, Inform. Process. Lett., 29, 105, 10.1016/0020-0190(88)90037-3 · DOI
- Moffat, 1985, An all pairs shortest path algorithm with expected running time O(n2log n), Proc. Conf. Found. Comp. Sci., 101
- Rowe, 1987, A browser for directed graphs, Software Pract. Exper., 17, 61, 10.1002/spe.4380170107 · DOI
- Spira, 1973, A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2log2n), SIAM J. Comput., 2, 28, 10.1137/0202004 · DOI
- Sugiyama, 1981, Methods for visual understanding of hierarchical system structures, IEEE Trans. Syst. Man, Cybern., SMC-11, 109, 10.1109/TSMC.1981.4308636 · DOI · Paper page
- Tamassia, 1988, Automatic graph drawing and readability of diagrams, IEEE Trans. Syst. Man, Cybern., SMC-18, 61, 10.1109/21.87055 · DOI
- Tutte, 1963, How to draw a graph, Proc. London Math. Soc., 3, 743, 10.1112/plms/s3-13.1.743 · DOI · Paper page
- Warfield, 1977, Crossing theory and hierarchy mapping, IEEE Trans. Syst. Man, Cybern., SMC-7, 505, 10.1109/TSMC.1977.4309760 · DOI
Cited by
Software survey: VOSviewer, a computer program for bibliometric mapping
van Eck, N. J., & Waltman, L. (2010) · Scientometrics · doi:10.1007/s11192-009-0146-3 · Cited by 21,484
bibliometrix: An R-tool for comprehensive science mapping analysis
Aria, M., & Cuccurullo, C. (2017) · Journal of Informetrics · doi:10.1016/j.joi.2017.08.007 · Cited by 16,064
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
The Spread of Obesity in a Large Social Network over 32 Years
Christakis, N. A., & Fowler, J. H. (2007) · New England Journal of Medicine · doi:10.1056/nejmsa066082 · Cited by 5,007
Mapping the structural core of human cerebral cortex
Hagmann, P., Cammoun, L., Gigandet, X., Meuli, R., Honey, C. J., Wedeen, V. J., & Sporns, O. (2008) · PLoS Biology · doi:10.1371/journal.pbio.0060159 · Cited by 4,173
Metadata
- Authors
- Kamada, T., & Kawai, S.
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 1989-04
- Volume
- 31
- Issue
- 1
- Pages
- 7-15
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W2075220720
- Cited by
- 2,698
- References
- 0
- FWCI
- 7.09
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
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: An algorithm for drawing general undirected graphs. https://app.cochat.ai/papers/10.1016/0020-0190(89)90102-6
- The paper
- Kamada, T., & Kawai, S. (1989). An algorithm for drawing general undirected graphs. Information Processing Letters. https://doi.org/10.1016/0020-0190(89)90102-6
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.
