On the public citation graph

An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths

0 signed · 34 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/inco.1997.2620openalex-snapshot
All Pairs Shortest Distances for Graphs with Small Integer Length Edges
inferredcites →https://doi.org/10.1006/inco.1997.2632openalex-snapshot
Improved Parallel Integer Sorting without Concurrent Writing
inferredcites →https://doi.org/10.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1007/11534273_28openalex-snapshot
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time
inferredcites →https://doi.org/10.1007/11561071_68openalex-snapshot
Shortest Paths in Matrix Multiplication Time
inferredcites →https://doi.org/10.1007/3-540-45465-9_9openalex-snapshot
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
inferredcites →https://doi.org/10.1007/978-3-540-30551-4_78openalex-snapshot
A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths
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/j.ipl.2004.05.006openalex-snapshot
Improved algorithm for all pairs shortest paths
inferredcites →https://doi.org/10.1016/j.ipl.2005.08.008openalex-snapshot
An time algorithm for the all-pairs shortest path problem
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1080/00207169008803814openalex-snapshot
A more efficient algorithm for the min-plus multiplication
inferredcites →https://doi.org/10.1109/sfcs.2005.20openalex-snapshot
Answering distance queries in directed graphs using fast matrix multiplication
inferredcites →https://doi.org/10.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1137/s0097539702419650openalex-snapshot
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/316542.316548openalex-snapshot
Undirected single-source shortest paths with positive integer weights in linear time
inferredcites →https://doi.org/10.1145/567112.567114openalex-snapshot
All pairs shortest paths using bridging sets and rectangular matrix multiplication

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_65openalex-snapshot
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_72openalex-snapshot
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_20openalex-snapshot
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.008openalex-snapshot
O(1) query time algorithm for all pairs shortest distances on permutation graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.015openalex-snapshot
A note of an time algorithm for all pairs shortest paths
inferred← citeshttps://doi.org/10.1016/j.jda.2013.03.005openalex-snapshot
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
inferred← citeshttps://doi.org/10.1145/1250790.1250876openalex-snapshot
All-pairs bottleneck paths for general graphs in truly sub-cubic time
inferred← citeshttps://doi.org/10.1145/1250790.1250877openalex-snapshot
More algorithms for all-pairs shortest paths in weighted graphs
inferred← citeshttps://doi.org/10.1145/1798596.1798597openalex-snapshot
Finding heaviest H -subgraphs in real weighted graphs, with applications
inferred← citeshttps://doi.org/10.1145/3626567openalex-snapshot
Finding the k Shortest Simple Paths: Time and Space trade-offs
inferred← citeshttps://doi.org/10.1515/ausi-2016-0002openalex-snapshot
A survey of the all-pairs shortest paths problem and its variants in graphs
inferred← citeshttps://doi.org/10.3390/math11234806openalex-snapshot
Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs
inferred← citeshttps://doi.org/10.35376/10324/16003openalex-snapshot
Parallel approaches to shortest-path problems for multilevel heterogeneous computing
inferred← citeshttps://doi.org/10.48550/arxiv.1705.02044openalex-snapshot
A Survey of Shortest-Path Algorithms
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.