Distributed algorithms for the Lovász local lemma and graph coloring

The Lovász local lemma (LLL), introduced by Erdős and Lovász in 1975, is a powerful tool of the probabilistic method that allows one to prove that a set of n “bad” events do not happen with non-zero probability, provided that the events have limited dependence. However, the LLL itself does not sugge...

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 30; no. 4; pp. 261 - 280
Main Authors:	Chung, Kai-Min, Pettie, Seth, Su, Hsin-Hao
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2017 Springer Nature B.V
Subjects:	Algorithms Asymmetry Coloring Computer Communication Networks Computer Hardware Computer networks Computer Science Computer Systems Organization and Communication Networks Graph coloring Graphs Probabilistic methods Software Engineering/Programming and Operating Systems Theory of Computation Coloring Randomized algorithms Lovász local lemma Locality Distributed algorithms
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!