On the public citation graph
A parallel shortest path algorithm
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
inferredcites →https://doi.org/10.1016/0166-218x(86)90072-7openalex-snapshot
Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau
inferredcites →https://doi.org/10.1093/comjnl/9.3.275openalex-snapshot
Finding the Shortest Route between Two Points in a Network
inferredcites →https://doi.org/10.1145/363269.363610openalex-snapshot
Algorithm 360: shortest-path forest with topological ordering [H]
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.4500080505openalex-snapshot
Performance analysis of fast distributed link restoration algorithms
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_83openalex-snapshot
A Dynamic Window-Based Approximate Shortest Path Re-computation Method for Digital Road Map Databases in Mobile Environments
inferred← citeshttps://doi.org/10.1007/3-540-44868-3_44openalex-snapshot
Neural Implementation of Dijkstra’s Algorithm.
inferred← citeshttps://doi.org/10.1007/3-540-44868-3_45openalex-snapshot
Spurious minima and basins of attraction in higher-order Hopfield networks
inferred← citeshttps://doi.org/10.1007/978-1-4899-1298-5_34openalex-snapshot
RREACT: A Distributed Network Restoration Protocol for Rapid Restoration of Active Communication Trunks
inferred← citeshttps://doi.org/10.1007/bf01299142openalex-snapshot
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm
inferred← citeshttps://doi.org/10.1007/bf02192173openalex-snapshot
Parallel asynchronous label-correcting methods for shortest paths
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90088-4openalex-snapshot
Parallel search algorithms for graphs and trees
inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.004openalex-snapshot
MM: A bidirectional search algorithm that is guaranteed to meet in the middle
inferred← citeshttps://doi.org/10.1016/s0278-6125(98)80077-0openalex-snapshot
A survey of factory control algorithms that can be implemented in a multi-agent heterarchy: Dispatching, scheduling, and pull
inferred← citeshttps://doi.org/10.1080/00396265.2024.2335581openalex-snapshot
An overall adjustment method for relative corrections of master reference stations in the BDS/GNSS network RTK system
inferred← citeshttps://doi.org/10.1109/21.281425openalex-snapshot
A bibliography of heuristic search research through 1992
inferred← citeshttps://doi.org/10.1109/26.179933openalex-snapshot
Algorithms for finding an optimal set of short disjoint paths in a communication network
inferred← citeshttps://doi.org/10.1109/3468.594911openalex-snapshot
Route finding by using knowledge about the road network
inferred← citeshttps://doi.org/10.1109/milcom.1991.258192openalex-snapshot
Algorithms for finding an optimal set of short disjoint paths in a communication network
inferred← citeshttps://doi.org/10.1109/milcom.1991.258231openalex-snapshot
An efficient algorithm for the calculation of node-pair reliability
inferred← citeshttps://doi.org/10.1109/pccc.1993.344455openalex-snapshot
A fast distributed network restoration algorithm
inferred← citeshttps://doi.org/10.1109/tkde.2002.1033772openalex-snapshot
An efficient path computation model for hierarchically structured topographical road maps
inferred← citeshttps://doi.org/10.1287/inte.20.4.133openalex-snapshot
The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12218openalex-snapshot
A Brief History and Recent Achievements in Bidirectional Search
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.