Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 2,698

The DOI matches its Crossref record.

An algorithm for drawing general undirected graphs

Kamada, Tomihisa, Kawai, Satoru·1989·Information Processing Letters
DOI 10.1016/0020-0190(89)90102-6
Open this paper in CoChat — free account

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.1016/0020-0190(89)90102-6

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.

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

No references could be resolved yet.

Research works printed but not linked: 16

  1. Batini, 1986, A layout algorithm for data flow diagrams, IEEE Trans. Software Eng., SE-12, 538, 10.1109/TSE.1986.6312901 · DOI
  2. Becker, 1987, On the optimal layout of planar graphs with fixed boundary, SIAM J. Comput., 16, 946, 10.1137/0216061 · DOI
  3. 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
  4. Corneil, 1970, An efficient algorithm for graph isomorphism, J. ACM, 17, 51, 10.1145/321556.321562 · DOI · Paper page
  5. Eades, 1984, A heuristics for graph drawing, Congr. Numer., 42, 149
  6. Floyd, 1962, Algorithm 97: shortest path, Comm. ACM, 5, 345, 10.1145/367766.368168 · DOI · Paper page
  7. 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
  8. Lipton, 1985, A method for drawing graphs, Proc. ACM Symposium on Computational Geometry, 153, 10.1145/323233.323254 · DOI
  9. Mittal, 1988, A fast backtrack algorithm for graph isomorphism, Inform. Process. Lett., 29, 105, 10.1016/0020-0190(88)90037-3 · DOI
  10. Moffat, 1985, An all pairs shortest path algorithm with expected running time O(n2log n), Proc. Conf. Found. Comp. Sci., 101
  11. Rowe, 1987, A browser for directed graphs, Software Pract. Exper., 17, 61, 10.1002/spe.4380170107 · DOI
  12. 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
  13. 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
  14. Tamassia, 1988, Automatic graph drawing and readability of diagrams, IEEE Trans. Syst. Man, Cybern., SMC-18, 61, 10.1109/21.87055 · DOI
  15. Tutte, 1963, How to draw a graph, Proc. London Math. Soc., 3, 743, 10.1112/plms/s3-13.1.743 · DOI · Paper page
  16. Warfield, 1977, Crossing theory and hierarchy mapping, IEEE Trans. Syst. Man, Cybern., SMC-7, 505, 10.1109/TSMC.1977.4309760 · DOI

Cited by

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)
DOI
10.1016/0020-0190(89)90102-6
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

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.