On the public citation graph
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
0 signed · 40 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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0196-6774(80)90017-6openalex-snapshot
Linear expected-time algorithms for connectivity problems
inferredcites →https://doi.org/10.1063/1.3034322openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
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/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1137/0206050openalex-snapshot
A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem
inferredcites →https://doi.org/10.1137/0207011openalex-snapshot
An Algorithm for Transitive Closure with Linear Expected Time
inferredcites →https://doi.org/10.1145/321707.321712openalex-snapshot
Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and N 3 Comparisons
inferredcites →https://doi.org/10.1145/359619.359631openalex-snapshot
Implementing Quicksort programs
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/(sici)1098-2418(200001)16:1<33::aid-rsa3>3.0.co;2-0openalex-snapshot
Average-case complexity of shortest-paths problems in the vertex-potential model
inferred← citeshttps://doi.org/10.1006/jagm.1998.0937openalex-snapshot
Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_51openalex-snapshot
An efficient parallel algorithm for the all pairs shortest path problem
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/3-540-61310-2_8openalex-snapshot
Finding real-valued single-source shortest paths in o(n 3) expected time
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_4openalex-snapshot
Average-Case Complexity of the Min-Sum Matrix Product 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/bf00938761openalex-snapshot
Shortest paths in networks with vector weights
inferred← citeshttps://doi.org/10.1007/bf01190847openalex-snapshot
All-pairs shortest paths and the essential subgraph
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(84)90109-1openalex-snapshot
A priority queue for the all pairs shortest path problem
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90059-9openalex-snapshot
The shortest-path problem for graphs with random arc-lengths
inferred← citeshttps://doi.org/10.1016/0169-7552(86)90052-8openalex-snapshot
Grade of service and optimization of distributed packet-switched networks
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90009-4openalex-snapshot
A theorem on the expected complexity of dijkstra's shortest path algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.008openalex-snapshot
Average-case complexity of the min-sum matrix product problem
inferred← citeshttps://doi.org/10.1109/focs.2010.69openalex-snapshot
All-Pairs Shortest Paths in O(n²) Time with High Probability
inferred← citeshttps://doi.org/10.1109/focs.2013.81openalex-snapshot
A Forward-Backward Single-Source Shortest Paths Algorithm
inferred← citeshttps://doi.org/10.1109/icraie.2014.6909213openalex-snapshot
A novel APSP algorithm and its application in Multi Domain SDN
inferred← citeshttps://doi.org/10.1109/sfcs.1985.6openalex-snapshot
An all pairs shortest path algorithm with expected running time O(n 2logn)
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185419openalex-snapshot
Finding the hidden path: time bounds for all-pairs shortest paths
inferred← citeshttps://doi.org/10.1137/0216065openalex-snapshot
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
inferred← citeshttps://doi.org/10.1137/140970975openalex-snapshot
A Forward-Backward Single-Source Shortest Paths Algorithm
inferred← citeshttps://doi.org/10.1145/2508028.2505988openalex-snapshot
All-pairs shortest paths in O ( n 2 ) time with high probability
inferred← citeshttps://doi.org/10.1287/moor.10.4.557openalex-snapshot
On Shortest Paths in Graphs with Random Weights
inferred← citeshttps://doi.org/10.1349/ddlp.2780openalex-snapshot
Exact and approximation algorithms for network flow and disjoint-path problems.
inferred← citeshttps://doi.org/10.22028/d291-25863openalex-snapshot
Average-case complexity of shortest-paths problems
inferred← citeshttps://doi.org/10.26493/1855-3974.2467.497openalex-snapshot
Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
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.