A dynamic algorithm maintains a maximal independent set in an edge-update stream with amortized O(log^3 n) update time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dynamic Maximal Independent Set
A dynamic algorithm maintains a maximal independent set in an edge-update stream with amortized O(log^3 n) update time.