arXiv · 2611.17215
Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights
Abstract
We give a deterministic algorithm for all-pairs shortest paths in directed $n$-vertex graphs with arbitrary finite real edge weights and no negative cycles. It computes all distances in $O(n^{2.9929729})$ worst-case time, improving both the recent deterministic bound $O(n^{2.9997})$ and the Las Vegas expected-time bound $O(n^{2.993805})$. We use a model with exact real addition, subtraction and comparison at unit cost; auxiliary integer arithmetic and indexed memory access are charged at bit cost.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy. 2026-11-15. Faster Deterministic All-Pairs Shortest Paths with Real Edge Weights. https://searcharxiv.com/abs/2611.17215
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.