New dynamic data structures support long-path, long-detour, and parity queries on fully dynamic graphs with amortized time 2^{O(k^3)} polylog n.
Fully dynamic bicon- nectivity in eO(log2 n)time.CoRR, abs/2503.21733
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
-
Dynamic Detours
New dynamic data structures support long-path, long-detour, and parity queries on fully dynamic graphs with amortized time 2^{O(k^3)} polylog n.