The work defines separated low-diameter decompositions for directed graphs and proves the first sub-logarithmic diameter guarantees via small modifications to two prior algorithms.
Hardness of approxi- mation in p via short cycle removal: cycle detection, distance oracles, and beyond
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
The work defines separated low-diameter decompositions for directed graphs and proves the first sub-logarithmic diameter guarantees via small modifications to two prior algorithms.