A prediction-augmented data structure for incremental SCC maintenance achieves near-optimal update times with accurate edge-order predictions and degrades smoothly with prediction error.
My own algorithm — offline incremental strongly connected components in o(m log(m)).https://codeforces.com/blog/entry/91608, 2021
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Incremental Strongly Connected Components with Predictions
A prediction-augmented data structure for incremental SCC maintenance achieves near-optimal update times with accurate edge-order predictions and degrades smoothly with prediction error.