Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights

For directed $n$-vertex graphs with arbitrary finite real edge weights and no negative cycles, we compute all-pairs distances deterministically in $O(n^{2.9929729})$ worst-case time using Uznański's half-width matrix multiplication bound. Using only the Le Gall--Urrutia rectangular multiplication bounds, our algorithm runs in $O(n^{2.99306273})$ time. This improves both the deterministic bound of $O(n^{2.9997})$ due to Chan, Itakura, Ma and Yu and the Las Vegas expected-time bound of $O(n^{2.993805})$ reported in the shreshth-s working note.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17215
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights

Aryeh Lev Zabokritskiy, Isaac Barouch Essayag
arXiv (Cornell University)
Complexity and Algorithms in Graphs
preprint

Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights

Aryeh Lev Zabokritskiy, Isaac Barouch Essayag
preprint en

Abstract

For directed $n$-vertex graphs with arbitrary finite real edge weights and no negative cycles, we compute all-pairs distances deterministically in $O(n^{2.9929729})$ worst-case time using Uznański's half-width matrix multiplication bound. Using only the Le Gall--Urrutia rectangular multiplication bounds, our algorithm runs in $O(n^{2.99306273})$ time. This improves both the deterministic bound of $O(n^{2.9997})$ due to Chan, Itakura, Ma and Yu and the Las Vegas expected-time bound of $O(n^{2.993805})$ reported in the shreshth-s working note.

arXiv (Cornell University)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon