On the public citation graph
An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem
0 signed · 14 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.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/0206050openalex-snapshot
A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem
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.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-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-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/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
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.1109/focs.2013.81openalex-snapshot
A Forward-Backward Single-Source Shortest Paths Algorithm
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.1137/0216065openalex-snapshot
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
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.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.