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

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

Algorithm 360: shortest-path forest with topological ordering [H]

Open access
Dial, Robert B.·1969·Communications of the ACM

Abstract

view.)Write the observations in the order specified above.Write row one of Mn down the right edge of a strip of paper using the same spacing as for the observations. Now place this movable strip alongside the observation vector so that the top element on the paper strip is opposite the top element of the observation vector.Multiply adjacent elements and write the sum of these products at the top of a new column.Now slide the paper strip down tn spaces.Form the indicated inner product as before and

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/363269.363610

Cites

1 of 1 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 1 references

Cited by

See all 369

Metadata

Authors
Dial, R. B.
Venue
Communications of the ACM
Published
1969-11
Volume
12
Issue
11
Pages
632-633
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W2085917651
Cited by
369
References
1
FWCI
0.48
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: Algorithm 360: shortest-path forest with topological ordering [H]. https://app.cochat.ai/papers/10.1145/363269.363610
The paper
Dial, R. B. (1969). Algorithm 360: shortest-path forest with topological ordering [H]. Communications of the ACM. https://doi.org/10.1145/363269.363610

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.