On the public citation graph
Termination Detection for Parallel Shortest Path Algorithms
0 signed · 23 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.1007/bf02192173openalex-snapshot
Parallel asynchronous label-correcting methods for shortest paths
inferredcites →https://doi.org/10.1007/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
inferredcites →https://doi.org/10.1016/0020-0190(83)90092-3openalex-snapshot
Derivation of a termination detection algorithm for distributed computations
inferredcites →https://doi.org/10.1016/0020-0190(88)90125-1openalex-snapshot
A fully distributed termination detection scheme
inferredcites →https://doi.org/10.1016/0166-218x(94)90171-6openalex-snapshot
Network flows: Theory, algorithms and applications
inferredcites →https://doi.org/10.1016/0167-8191(95)00025-jopenalex-snapshot
An experimental comparison of two distributed single-source shortest path algorithms
inferredcites →https://doi.org/10.1109/hicss.1996.495509openalex-snapshot
Balancing load versus decreasing communication: exploring the tradeoffs
inferredcites →https://doi.org/10.1287/opre.24.6.1164openalex-snapshot
Technical Note—Shortest-Path Algorithms: A Comparison
inferredcites →https://doi.org/10.1287/trsc.28.4.292openalex-snapshot
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-89197-0_54openalex-snapshot
Towards Autonomous Robot Operation: Path Map Generation of an Unknown Area by a New Trapezoidal Approximation Method Using a Self Guided Vehicle and Shortest Path Calculation by a Proposed SRS Algorithm
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106193openalex-snapshot
A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.07.003openalex-snapshot
Parallel implementation of a transportation network model
inferred← citeshttps://doi.org/10.1016/j.parco.2003.05.004openalex-snapshot
Parallel implementation of geometric shortest path algorithms
inferred← citeshttps://doi.org/10.1016/j.trpro.2018.11.041openalex-snapshot
On the Implementation of High Performance Computing Extensionfor Day-to-Day Traffic Assignment
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00105-3openalex-snapshot
Implementing parallel shortest path for parallel transportation applications
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot
Δ-stepping: a parallelizable shortest path algorithm
inferred← citeshttps://doi.org/10.1090/dimacs/074/10openalex-snapshot
Parallel shortest path algorithms for solving large-scale instances
inferred← citeshttps://doi.org/10.1109/itsc.2015.62openalex-snapshot
Introduction to Parallelization of a Quasi-Anisotropic Mesoscopic Model for Network Traffic Simulation
inferred← citeshttps://doi.org/10.1137/1.9781611972870.3openalex-snapshot
An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
inferred← citeshttps://doi.org/10.2172/993883openalex-snapshot
LDRD final report : massive multithreading applied to national infrastructure and informatics.
inferred← citeshttps://doi.org/10.22028/d291-25720openalex-snapshot
Design and analysis of sequential and parallel single-source shortest-paths algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06702openalex-snapshot
The Anatomy of Large-Scale Distributed Graph Algorithms
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.