Search Results

Documents authored by Mao, Xiao


Document
Track A: Algorithms, Complexity and Games
A Faster Directed Single-Source Shortest Path Algorithm

Authors: Ran Duan, Xiao Mao, Xinkai Shu, and Longhui Yin

Published in: LIPIcs, Volume 374, 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)


Abstract
This paper presents a new deterministic algorithm for the single-source shortest paths (SSSP) problem on real non-negative edge-weighted directed graphs, with running time O(m√{log n} + √{mnlog nlog log n}), which is O(m√{log nlog log n}) for sparse graphs. This improves the recent breakthrough result of O(m log^{2/3} n) time for directed SSSP algorithm [Duan, Mao, Mao, Shu, Yin 2025].

Cite as

Ran Duan, Xiao Mao, Xinkai Shu, and Longhui Yin. A Faster Directed Single-Source Shortest Path Algorithm. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 374, pp. 81:1-81:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{duan_et_al:LIPIcs.ICALP.2026.81,
  author =	{Duan, Ran and Mao, Xiao and Shu, Xinkai and Yin, Longhui},
  title =	{{A Faster Directed Single-Source Shortest Path Algorithm}},
  booktitle =	{53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)},
  pages =	{81:1--81:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-428-4},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{374},
  editor =	{Bhattacharya, Sayan and Nanongkai, Danupon and Benedikt, Michael and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.81},
  URN =		{urn:nbn:de:0030-drops-264706},
  doi =		{10.4230/LIPIcs.ICALP.2026.81},
  annote =	{Keywords: Shortest Paths, Graph Algorithms}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail