Simpler and Faster Directed Low-Diameter Decompositions
Abstract
We present a simpler and faster algorithm for low-diameter decompositions on directed graphs, matching the O( n n) loss factor from Bringmann, Fischer, Haeupler, and Latypov (ICALP 2025) and improving the running time to O((m+n n)2n).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.