On the public citation graph

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

0 signed · 46 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-52921-7_94openalex-snapshot

Efficient parallel algorithms for path problems in planar directed graphs

inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot

A note on two problems in connexion with graphs

inferredcites →https://doi.org/10.1016/0020-0190(88)90164-0openalex-snapshot

An improved parallel algorithm that computes the BFS numbering of a directed graph

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/0020-0190(92)90200-fopenalex-snapshot

A new upper bound on the complexity of the all pairs shortest path problem

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.1109/tc.1983.1676223openalex-snapshot

Binary Trees and Parallel Scheduling Algorithms

inferredcites →https://doi.org/10.1137/0204030openalex-snapshot

Parallelism in Comparison Problems

inferredcites →https://doi.org/10.1137/0205006openalex-snapshot

New Bounds on the Complexity of the Shortest Path Problem

inferredcites →https://doi.org/10.1137/0210049openalex-snapshot

Parallel Matrix and Graph Algorithms

inferredcites →https://doi.org/10.1137/0214030openalex-snapshot

Probabilistic Parallel Algorithms for Sorting and Selection

inferredcites →https://doi.org/10.1137/0224051openalex-snapshot

Work-Preserving Speed-Up of Parallel Matrix Computations

inferredcites →https://doi.org/10.1145/129712.129784openalex-snapshot

On the all-pairs-shortest-path problem

inferredcites →https://doi.org/10.1145/140901.141926openalex-snapshot

Supereffective slow-down of parallel computations

inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot

Efficient Algorithms for Shortest Paths in Sparse Networks

inferredcites →https://doi.org/10.1145/367766.368168openalex-snapshot

Algorithm 97: Shortest path

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-44681-8_49openalex-snapshot

Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs

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/978-3-540-27798-9_31openalex-snapshot

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

inferred← citeshttps://doi.org/10.1007/bfb0023482openalex-snapshot

Finding the k shortest paths in parallel

inferred← citeshttps://doi.org/10.1007/s00453-002-0995-0openalex-snapshot

Efficient Parallel Algorithms for Planar st-Graphs

inferred← citeshttps://doi.org/10.1007/s004530010038openalex-snapshot

Finding the k Shortest Paths in Parallel

inferred← citeshttps://doi.org/10.1007/s10766-013-0300-7openalex-snapshot

A Parallel Implementation for the Negative Cost Girth Problem

inferred← citeshttps://doi.org/10.1016/j.ipl.2004.03.015openalex-snapshot

External matrix multiplication and all-pairs shortest path

inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00076-2openalex-snapshot

Δ-stepping: a parallelizable shortest path algorithm

inferred← citeshttps://doi.org/10.1073/pnas.0805344105openalex-snapshot

Ordered cyclic motifs contribute to dynamic stability in biological and engineered networks

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/geoinformatics.2010.5568155openalex-snapshot

CkNN monitoring based on parallel pre-computing

inferred← citeshttps://doi.org/10.1109/icsmc.2006.385045openalex-snapshot

An Effective Anytime Anywhere Parallel Approach for Centrality Measurements in Social Network Analysis

inferred← citeshttps://doi.org/10.1109/icycs.2008.352openalex-snapshot

A New Algorithm for Network Diameter

inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015582openalex-snapshot

Buckets strike back: improved parallel shortest-paths

inferred← citeshttps://doi.org/10.1109/ipdps.2014.96openalex-snapshot

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

inferred← citeshttps://doi.org/10.1109/mdm.2013.82openalex-snapshot

An Efficient Pre-computation Technique for Approximation Distance Query in Road Networks

inferred← citeshttps://doi.org/10.1109/tpds.2016.2634535openalex-snapshot

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

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.1142/s0129626499000475openalex-snapshot

PARALLEL ALGORITHMS FOR LONGEST INCREASING CHAINS IN THE PLANE AND RELATED PROBLEMS

inferred← citeshttps://doi.org/10.1145/2452376.2452413openalex-snapshot

Efficient breadth-first search on large graphs with skewed degree distributions

inferred← citeshttps://doi.org/10.1201/9781584889106.ch12openalex-snapshot

Multithreaded Algorithms for Processing Massive Graphs

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.2991/isci-15.2015.92openalex-snapshot

An Application of Mobile Cloud Computing in the GPS of Taxi

inferred← citeshttps://doi.org/10.3390/app11178083openalex-snapshot

A Parallel Algorithm for Scheduling a Two-Machine Robotic Cell in Bicycle Frame Welding Process

inferred← citeshttps://doi.org/10.33915/etd.312openalex-snapshot

On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks

inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.254openalex-snapshot

Improved Bounds for Bipartite Matching on Surfaces

inferred← citeshttps://doi.org/10.48550/arxiv.1903.06697openalex-snapshot

Graph Processing on FPGAs: Taxonomy, Survey, Challenges

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.