A parallel batch-dynamic algorithm maintains a lexicographically-first maximal independent set with O(b log^3 n) expected work and polylog depth, outperforming prior sequential dynamic algorithms even for single updates.
Optimal fully dynamick-center clustering for adaptive and oblivious adversaries
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
-
Parallel Batch-Dynamic Maximal Independent Set
A parallel batch-dynamic algorithm maintains a lexicographically-first maximal independent set with O(b log^3 n) expected work and polylog depth, outperforming prior sequential dynamic algorithms even for single updates.