Local resampling and backtracking algorithms for the Lovász Local Lemma achieve near-linear total work in the number of adaptive updates when constraints are added or removed.
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
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 Construction of the Lov\'asz Local Lemma
Local resampling and backtracking algorithms for the Lovász Local Lemma achieve near-linear total work in the number of adaptive updates when constraints are added or removed.