Distributed algorithms for the Lovász local lemma and graph coloring
Open Access
- 15 July 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 134-143
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- New Constructive Aspects of the Lovász Local LemmaJournal of the ACM, 2011
- Asymptotically optimal frugal colouringJournal of Combinatorial Theory, Series B, 2010
- A constructive proof of the general lovász local lemmaJournal of the ACM, 2010
- Asymptotically the List Colouring Constants Are 1Journal of Combinatorial Theory, Series B, 2002
- Near-optimal, distributed edge colouring via the nibble methodTheoretical Computer Science, 1998
- Colouring a graph frugallyCombinatorica, 1997
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Asymptotic lower bounds for Ramsey functionsDiscrete Mathematics, 1977