On the public citation graph
An all pairs shortest path algorithm with expected running time O(n 2logn)
0 signed · 24 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/bfb0022539openalex-snapshot
An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem
inferredcites →https://doi.org/10.1016/0166-218x(85)90059-9openalex-snapshot
The shortest-path problem for graphs with random arc-lengths
inferredcites →https://doi.org/10.1080/00401706.1973.10489056openalex-snapshot
An Introduction to Probability Theory and Its Applications
inferredcites →https://doi.org/10.1109/sfcs.1975.22openalex-snapshot
On the decision tree complexity of the shortest path problems
inferredcites →https://doi.org/10.1137/0202004openalex-snapshot
A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
inferredcites →https://doi.org/10.1137/0212039openalex-snapshot
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
inferredcites →https://doi.org/10.1287/mnsc.6.2.187openalex-snapshot
On the Shortest Route Through a Network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230220103openalex-snapshot
An optimal algorithm to solve the all‐pair shortest path problem on interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_20openalex-snapshot
A new upper bound on the complexity of the all pairs shortest path problem
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_71openalex-snapshot
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_143openalex-snapshot
On the all-pairs shortest path algorithm of Moffat and Takaoka
inferred← citeshttps://doi.org/10.1007/978-3-642-04802-9_11openalex-snapshot
Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_16openalex-snapshot
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_11openalex-snapshot
Probabilistic Analysis of Graph Algorithms
inferred← citeshttps://doi.org/10.1007/bf00259470openalex-snapshot
Minimizing time-space cost for database version control
inferred← citeshttps://doi.org/10.1007/s10878-012-9550-3openalex-snapshot
A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90102-6openalex-snapshot
An algorithm for drawing general undirected graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90267-jopenalex-snapshot
On-line computation of minimal and maximal length paths
inferred← citeshttps://doi.org/10.1109/icpads.1994.589892openalex-snapshot
Semigroup computation and its applications on mesh-connected computers with hyperbus broadcasting
inferred← citeshttps://doi.org/10.1145/308386.308460openalex-snapshot
Minimizing time-space cost for database version control
inferred← citeshttps://doi.org/10.22028/d291-25863openalex-snapshot
Average-case complexity of shortest-paths problems
inferred← citeshttps://doi.org/10.48550/arxiv.1705.02044openalex-snapshot
A Survey of Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.5555/365411.365449openalex-snapshot
Fast approximation of centrality
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.