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

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

Compact oracles for reachability and approximate distances in planar digraphs

Thorup, Mikkel · 2004 · Journal of the ACM

Abstract

It is shown that a planar digraph can be preprocessed in near-linear time, producing a near-linear space oracle that can answer reachability queries in constant time. The oracle can be distributed as an O (log n ) space label for each vertex and then we can determine if one vertex can reach another considering their two labels only.The approach generalizes to give a near-linear space approximate distances oracle for a weighted planar digraph. With weights drawn from {0, …, N }, it approximates distances within a factor (1 + ε) in O (log log ( nN ) + 1/ε) time. Our scheme can be extended to find and route along correspondingly short dipaths.

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

Cites

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

Cited by

See all 257

Metadata

Authors
Thorup, M.
Venue
Journal of the ACM
Published
2004-11
Volume
51
Issue
6
Pages
993-1024
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W2096304547
Cited by
257
References
10
FWCI
10.20
Type
journal article
Language
en
Open access
closed

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: Compact oracles for reachability and approximate distances in planar digraphs. https://app.cochat.ai/papers/10.1145/1039488.1039493
The paper
Thorup, M. (2004). Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM. https://doi.org/10.1145/1039488.1039493

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.