On the public citation graph

Parallel algorithms for the single source shortest path problem

https://doi.org/10.1007/bf02254849
0 signed · 32 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.1975.5.3.299openalex-snapshot
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
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.1016/0196-6774(80)90004-8openalex-snapshot
A parallel algorithm for constructing minimum spanning trees
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/s0065-2458(08)60033-9openalex-snapshot
The Structure of Parallel Algorithms
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1109/tse.1981.230833openalex-snapshot
Communication Issues in the Design and Analysis of Parallel Algorithms
inferredcites →https://doi.org/10.1137/0207020openalex-snapshot
Parallel Computations in Graph Theory
inferredcites →https://doi.org/10.1145/321765.321768openalex-snapshot
A Note on Dijkstra's Shortest Path Algorithm
inferredcites →https://doi.org/10.1145/355900.355919openalex-snapshot
Algorithm 562: Shortest Path Lengths [H]
inferredcites →https://doi.org/10.1145/357084.357093openalex-snapshot
Corrigendum: “A New Approach to Proving the Correctness of Multiprocess Programs”
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.7907/15zs-9x82openalex-snapshot
The Tree Machine: A Highly Concurrent Computing Environment

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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-4613-3400-2_6openalex-snapshot
Parallel Algorithms for Network Problems
inferred← citeshttps://doi.org/10.1007/bf01935049openalex-snapshot
Parallel algorithms for analyzing activity networks
inferred← citeshttps://doi.org/10.1016/0020-0255(87)90039-9openalex-snapshot
Algorithms for some graph problems on a distributed computational model
inferred← citeshttps://doi.org/10.1016/0167-8191(87)90064-0openalex-snapshot
ADA multitasking and the single source shortest path 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/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.1016/s0304-0208(08)73240-7openalex-snapshot
Parallel Computer Models and Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1080/00207218708921011openalex-snapshot
Efficient algorithms for some graph problems on a tree-structured parallel computer
inferred← citeshttps://doi.org/10.1080/00207219008921232openalex-snapshot
Parallel algorithm for analysing activity networks on a tree-structured computer
inferred← citeshttps://doi.org/10.1145/2514.2515openalex-snapshot
Parallel graph algorithms
inferred← citeshttps://doi.org/10.1145/256563.257010openalex-snapshot
Distributed/parallel traffic simulation for IVHS applications
inferred← citeshttps://doi.org/10.5120/19613-1500openalex-snapshot
OpenCL Parallel Blocked Approach for Solving All Pairs Shortest Path Problem on GPU
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.