On the public citation graph
A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem
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/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.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/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
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.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
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-61310-2_8openalex-snapshot
Finding real-valued single-source shortest paths in o(n 3) expected time
inferred← citeshttps://doi.org/10.1007/bf00046618openalex-snapshot
Probabilistic analysis of optimization algorithms-some aspects from a practical point of view
inferred← citeshttps://doi.org/10.1007/bfb0022539openalex-snapshot
An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem
inferred← citeshttps://doi.org/10.1007/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
inferred← citeshttps://doi.org/10.1016/0020-0190(78)90007-8openalex-snapshot
On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
inferred← citeshttps://doi.org/10.1016/0307-904x(83)90158-0openalex-snapshot
An algorithm to evaluate public transportation stops for minimizing passenger walking distance
inferred← citeshttps://doi.org/10.1016/b978-0-12-734250-4.50010-2openalex-snapshot
COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)61181-9openalex-snapshot
Chapter 4. The General Shortest-Path Problem
inferred← citeshttps://doi.org/10.1080/00207169008803814openalex-snapshot
A more efficient algorithm for the min-plus multiplication
inferred← citeshttps://doi.org/10.1137/0212039openalex-snapshot
A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
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.1145/800141.804687openalex-snapshot
A shortest-path algorithm with expected time O(n 2 log n log * n)
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
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
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.