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

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

A Unified Approach to Path Problems

Open access
Tarjan, Robert Endre·1981·Journal of the ACM
DOI 10.1145/322261.322272
Open this paper in CoChat — free account

Abstract

A general method is described for solving path problems on directed graphs.Such path problems include finding shortest paths, solving sparse systems of hnear equaUons, and carrying out global flow analysis of computer programs The method consists of two steps First, a collecUon of regular expressions representmg sets of paths m the graph Is constructed This can be done by using any standard algorithm, such as Gaussmn or Gauss-Jordan elimination.Next, a natural mapping from regular expressions into the gwen problem domain is applied.The mappmgs required to find shortest paths are exhibited, sparse systems of hnear equations are solved, and global flow analysis Is carned out.The results provide a general-purpose algonthm for solwng any path problem and show that the problem of constructing path expressions is in some sense the most general path problem.

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

Cites

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

Cited by

See all 253

Metadata

Authors
Tarjan, R. E.
Venue
Journal of the ACM
Publisher
Association for Computing Machinery (ACM)
Published
1981-07
Volume
28
Issue
3
Pages
577-593
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
DOI
10.1145/322261.322272
OpenAlex
W2010194128
Cited by
253
References
17
FWCI
11.37
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: A Unified Approach to Path Problems. https://app.cochat.ai/papers/10.1145/322261.322272
The paper
Tarjan, R. E. (1981). A Unified Approach to Path Problems. Journal of the ACM. https://doi.org/10.1145/322261.322272

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.