Simpler and Faster Directed Low-Diameter Decompositions
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915303077707776 |
|---|---|
| author | Li, Jason |
| author_facet | Li, Jason |
| contents | 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)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_10244 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Simpler and Faster Directed Low-Diameter Decompositions Li, Jason Data Structures and Algorithms 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)$. |
| title | Simpler and Faster Directed Low-Diameter Decompositions |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2505.10244 |