On the public citation graph
Efficient parallel algorithms for shortest paths in planar digraphs
0 signed · 34 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/3-540-52846-6_98openalex-snapshot
Efficient parallel algorithms for shortest paths in planar graphs
inferredcites →https://doi.org/10.1007/3-540-52921-7_94openalex-snapshot
Efficient parallel algorithms for path problems in planar directed graphs
inferredcites →https://doi.org/10.1007/3-540-53832-1_27openalex-snapshot
Optimal parallel algorithms for sparse graphs
inferredcites →https://doi.org/10.1007/3-540-54233-7_145openalex-snapshot
Computing shortest paths and distances in planar graphs
inferredcites →https://doi.org/10.1007/978-3-642-95486-3_22openalex-snapshot
Computer Networks with Compact Routing Tables
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1007/bf01994878openalex-snapshot
Efficient parallel algorithms for shortest paths in planar digraphs
inferredcites →https://doi.org/10.1016/0022-0000(88)90006-2openalex-snapshot
An efficient parallel algorithm for planarity
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
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)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1109/sfcs.1986.6openalex-snapshot
An efficient parallel algorithm for planarity
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.1989.63455openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1137/0217004openalex-snapshot
On the Complexity of Covering Vertices by Faces in a Planar Graph
inferredcites →https://doi.org/10.1137/0217009openalex-snapshot
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
inferredcites →https://doi.org/10.1145/102782.102788openalex-snapshot
Planar graph decomposition and all pairs shortest paths
inferredcites →https://doi.org/10.1145/28395.28398openalex-snapshot
A new approach to all pairs shortest paths in planar graphs
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
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.1006/jagm.1996.0048openalex-snapshot
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_190openalex-snapshot
Efficient sequential and parallel algorithms for the negative cycle problem
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_93openalex-snapshot
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_73openalex-snapshot
On-line and dynamic algorithms for shortest path problems
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_1openalex-snapshot
A Glimpse at Paul G. Spirakis
inferred← citeshttps://doi.org/10.1007/s004530010043openalex-snapshot
Improved Algorithms for Dynamic Shortest Paths
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00065-5openalex-snapshot
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
inferred← citeshttps://doi.org/10.1145/165231.165240openalex-snapshot
Efficient parallel shortest-paths in digraphs with a separator decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02591openalex-snapshot
A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time
showing the first 9 of 10 · page through all 10
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.