Faster Dynamic Maximal Independent Set against Adaptive Adversaries
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Dynamic (+1) Vertex Coloring with Adaptive Adversaries: Entropy Compression to the Rescue
- Improved Algorithms for Fully Dynamic Maximal Independent Set
- Dynamic (+1) -Coloring Against an Adaptive Adversary: Faster, Simpler, Worst-Case, and Bounded Recourse
- Simple dynamic algorithms for Maximal Independent Set and other problems
- Dynamic Construction of the Lov'asz Local Lemma
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time