Simpler and Faster Directed Low-Diameter Decompositions

Jason Li

Simpler and Faster Directed Low-Diameter Decompositions

Data Structures and Algorithms 2025-05-27 v3

Authors: Jason Li

Abstract

We present a simpler and faster algorithm for low-diameter decompositions on directed graphs, matching the $O(\log n\log\log n)$ loss factor from Bringmann, Fischer, Haeupler, and Latypov (ICALP 2025) and improving the running time to $O((m+n\log\log n)\log^2n)$ .

Keywords

graph algorithm

Cite

@article{arxiv.2505.10244,
  title  = {Simpler and Faster Directed Low-Diameter Decompositions},
  author = {Jason Li},
  journal= {arXiv preprint arXiv:2505.10244},
  year   = {2025}
}

Comments

10 pages. Fix error in Algorithm 2: it needs to cut both out-balls and in-balls. (This was the initial algorithm, which was then incorrectly simplified.)

Simpler and Faster Directed Low-Diameter Decompositions

Abstract

Keywords

Cite

Comments

Related papers