An algorithmic approach to the Lovász local lemma. I
- 1 December 1991
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 2 (4) , 343-365
- https://doi.org/10.1002/rsa.3240020402
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- Acyclic coloring of graphsRandom Structures & Algorithms, 1991
- Cycles of length 0 modulo k in directed graphsJournal of Combinatorial Theory, Series B, 1989
- The star arboricity of graphsDiscrete Mathematics, 1989
- The linear arboricity of graphsIsrael Journal of Mathematics, 1988
- Van der waerden and ramsey type gamesCombinatorica, 1981
- On positional gamesJournal of Combinatorial Theory, Series A, 1981
- On 3-chromatic hypergraphsDiscrete Mathematics, 1978
- On a combinatorial gameJournal of Combinatorial Theory, Series A, 1973