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
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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Fast Algorithms for Finding Nearest Common Ancestors
Harel, D., & Tarjan, R. E. (1984) · SIAM Journal on Computing · doi:10.1137/0213024 · Cited by 1,073
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
(2023) · doi:10.1145/3564246 · Cited by 587
Faster Shortest-Path Algorithms for Planar Graphs
Henzinger, M. R., Klein, P., Rao, S., & Subramanian, S. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1493 · Cited by 404
Algorithm 230: Matrix Permutation
Boothroyd, J. (1964) · Communications of the ACM · doi:10.1145/512274.512284 · Cited by 356
Sublinear time algorithms for metric space problems
Indyk, P. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301366 · Cited by 192
Proximity-preserving labeling schemes
Peleg, D. (2000) · Journal of Graph Theory · doi:10.1002/(sici)1097-0118(200003)33:3<167::aid-jgt7>3.0.co;2-5 · Cited by 125
Computer Networks with Compact Routing Tables
Leeuwen, J. V., & Tan, R. B. (1986) · Springer eBooks · doi:10.1007/978-3-642-95486-3_22 · Cited by 68
Cited by
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
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.