The paper gives an optimally sparse color fault-tolerant distance preserver for multi-source distances under single color faults, built by a combinatorial algorithm whose time is conditionally optimal under the BMM conjecture.
Simpler and better approximation algorithms for the unweighted minimum label s-t cut problem
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
-
Color Fault-Tolerant Distance Preservers: \~{O}ptimal Size in Conditionally \~{O}ptimal Time
The paper gives an optimally sparse color fault-tolerant distance preserver for multi-source distances under single color faults, built by a combinatorial algorithm whose time is conditionally optimal under the BMM conjecture.