On the public citation graph

A simple parallel algorithm for the single-source shortest path problem on planar digraphs

https://doi.org/10.1007/bfb0030108
0 signed · 33 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.1006/jagm.1996.0048openalex-snapshot
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
inferredcites →https://doi.org/10.1006/jpdc.1998.1425openalex-snapshot
A Parallel Priority Queue with Constant Time Operations
inferredcites →https://doi.org/10.1006/jpdc.2000.1646openalex-snapshot
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
inferredcites →https://doi.org/10.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs
inferredcites →https://doi.org/10.1016/0022-0000(88)90006-2openalex-snapshot
An efficient parallel algorithm for planarity
inferredcites →https://doi.org/10.1016/0890-5401(90)90034-fopenalex-snapshot
Optimal parallel algorithms on planar graphs
inferredcites →https://doi.org/10.1016/s0022-0000(05)80070-4openalex-snapshot
Planarity testing in parallel
inferredcites →https://doi.org/10.1109/sfcs.1987.3openalex-snapshot
A parallel algorithm for finding a separator in planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1993.366861openalex-snapshot
A linear-processor polylog-time algorithm for shortest paths in planar graphs
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1145/165231.165237openalex-snapshot
On Gazit and Miller's parallel algorithm for planar separators
inferredcites →https://doi.org/10.1145/165231.165240openalex-snapshot
Efficient parallel shortest-paths in digraphs with a separator decomposition
inferredcites →https://doi.org/10.1145/195058.195092openalex-snapshot
Faster shortest-path algorithms for planar graphs
inferredcites →https://doi.org/10.1145/237502.237545openalex-snapshot
A library of basic PRAM algorithms and its implementation in FORK
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferredcites →https://doi.org/10.1145/72935.72952openalex-snapshot
Parallel graph contraction
inferredcites →https://doi.org/10.5555/313852.313883openalex-snapshot
Worst-case efficient priority queues

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1425openalex-snapshot
A Parallel Priority Queue with Constant Time Operations
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1646openalex-snapshot
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_61openalex-snapshot
Parallel Shortest Path for Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_9openalex-snapshot
Distributed LTL Model Checking Based on Negative Cycle Detection
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_16openalex-snapshot
How to Employ Reverse Search in Distributed Single Source Shortest Paths
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_33openalex-snapshot
Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0055823openalex-snapshot
A parallelization of Dijkstra's shortest path algorithm
inferred← citeshttps://doi.org/10.1016/b978-85-352-7814-9.50009-9openalex-snapshot
Problemas de Conexão: Árvores, Caminhos e Emparelhamento
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000220openalex-snapshot
Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00153openalex-snapshot
Parallel Filtered Graphs for Hierarchical Clustering
inferred← citeshttps://doi.org/10.1109/ipps.1997.580979openalex-snapshot
A parallel priority data structure with applications
inferred← citeshttps://doi.org/10.1109/pdp.2014.17openalex-snapshot
Fast Diameter Computation of Large Sparse Graphs Using GPUs
inferred← citeshttps://doi.org/10.1111/tgis.12453openalex-snapshot
A distributed approach for calculating inundation height based on Dijkstra's algorithm
inferred← citeshttps://doi.org/10.3390/cryptography5040027openalex-snapshot
Parallel Privacy-Preserving Shortest Path 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.