Undirected 3-fault replacement paths are computed in O~(n^3) time, nearly matching the O(n^3) output size.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Undirected 3-Fault Replacement Path in Nearly Cubic Time
Undirected 3-fault replacement paths are computed in O~(n^3) time, nearly matching the O(n^3) output size.