An f-fault tolerant distance oracle with space O(f^4 n^2 log^2 (nW)) and query time O((c f log (nW))^{O(f^2)}) for graphs with integral edge weights.
An o (n 3 (loglog n/log n) 5/4) time algorithm for all pairs shortest paths
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Nearly Optimal Fault Tolerant Distance Oracle
An f-fault tolerant distance oracle with space O(f^4 n^2 log^2 (nW)) and query time O((c f log (nW))^{O(f^2)}) for graphs with integral edge weights.