First deterministic near-linear time algorithm for negative-weight single-source shortest paths on integer-weighted graphs, via a new deterministic padded decomposition construction on directed graphs.
Efficient algorithms for shortest paths in sparse networks
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
-
Deterministic Padded Decompositions and Negative-Weight Shortest Paths
First deterministic near-linear time algorithm for negative-weight single-source shortest paths on integer-weighted graphs, via a new deterministic padded decomposition construction on directed graphs.