A Faster Directed Single-Source Shortest Path Algorithm

Ran Duan,Xiao Mao,Xinkai Shu,Longhui Yin

International Colloquium on Automata, Languages and Programming (ICALP)（2026）CCF B

Tsinghua University

被引用2|浏览6

摘要

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(m√(log n)+√(mnlog nloglog n)), which is O(m√(log nloglog n)) for sparse graphs. This improves the recent breakthrough result of O(mlog^2/3 n) time for directed SSSP algorithm [Duan, Mao, Mao, Shu, Yin 2025].

更多

查看译文