On the public citation graph

An efficient parallel algorithm for shortest paths in planar layered digraphs

https://doi.org/10.1007/bf01294130
0 signed · 35 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/jcss.1997.1388openalex-snapshot
On the Exponent of the All Pairs Shortest Path Problem
inferredcites →https://doi.org/10.1007/3-540-17218-1_65openalex-snapshot
An algorithm for testing planarity of hierarchical graphs
inferredcites →https://doi.org/10.1007/3-540-52846-6_89openalex-snapshot
A faster parallel algorithm for a matrix searching problem
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01840401openalex-snapshot
Dynamic maintenance of planar digraphs, with applications
inferredcites →https://doi.org/10.1007/bfb0040377openalex-snapshot
Optimal parallel algorithms for expression tree evaluation and list ranking
inferredcites →https://doi.org/10.1016/0020-0190(91)90013-8openalex-snapshot
The parallel computation of minimum cost paths in graphs by stream contraction
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(89)90013-5openalex-snapshot
Fast and efficient solution of path algebra problems
inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot
On a routing problem
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.1988.21966openalex-snapshot
Notes on searching in multidimensional monotone arrays
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/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1137/0219066openalex-snapshot
Efficient Parallel Algorithms for String Editing and Related Problems
inferredcites →https://doi.org/10.1137/0220045openalex-snapshot
Parallel Transitive Closure and Point Location in Planar Structures
inferredcites →https://doi.org/10.1145/100216.100255openalex-snapshot
Separators in two and three dimensions
inferredcites →https://doi.org/10.1145/140901.141913openalex-snapshot
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
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/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms

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-63890-3_25openalex-snapshot
Efficient parallel algorithms for planar st-graphs
inferred← citeshttps://doi.org/10.1007/s00453-002-0995-0openalex-snapshot
Efficient Parallel Algorithms for Planar st-Graphs
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot
Δ-stepping: a parallelizable shortest path algorithm
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5358396openalex-snapshot
Towards tractable reasoning on temporal projection problems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470712openalex-snapshot
Designing scalable many-core parallel algorithms for min graphs using CUDA
inferred← citeshttps://doi.org/10.1109/itng.2010.230openalex-snapshot
Designing Efficient Many-Core Parallel Algorithms for All-Pairs Shortest-Paths Using CUDA
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch167openalex-snapshot
Massively Parallel Computation on Embedded Planar Graphs
inferred← citeshttps://doi.org/10.1145/3564246.3585235openalex-snapshot
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances
inferred← citeshttps://doi.org/10.21307/ijssis-2017-961openalex-snapshot
Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm
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.4230/lipics.calco.2021.20openalex-snapshot
The Open Algebraic Path Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2105.12905openalex-snapshot
Composing Behaviors of Networks
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.