This paper presents a new deterministic algorithm for single-source shortest paths (SSSP) on real non-negative edge-weighted directed graphs, with running time O(mlogn+mnlognloglogn), which is O(mlognloglogn) for sparse graphs. This improves the recent breakthrough result of O(mlog2/3n) time for directed SSSP algorithm [Duan, Mao, Mao, Shu, Yin 2025].
@article{arxiv.2602.07868,
title = {A Faster Directed Single-Source Shortest Path Algorithm},
author = {Ran Duan and Xiao Mao and Xinkai Shu and Longhui Yin},
journal= {arXiv preprint arXiv:2602.07868},
year = {2026}
}