Bellman-Ford in Almost-Linear Time for Dense Graphs
Data Structures and Algorithms
2026-02-19 v1
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 time by refining the shortcutting procedure introduced in Li, Li, Rao, and Zhang (2026).
Cite
@article{arxiv.2602.16153,
title = {Bellman-Ford in Almost-Linear Time for Dense Graphs},
author = {George Z. Li and Jason Li and Junkai Zhang},
journal= {arXiv preprint arXiv:2602.16153},
year = {2026}
}
Comments
21 pages