Bellman-Ford in Almost-Linear Time for Dense Graphs
Abstract
We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in n2+o(1) time by refining the shortcutting procedure introduced in Li, Li, Rao, and Zhang (2026).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.