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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Distributed computing Jg. 30; H. 4; S. 261 - 280
Hauptverfasser:	Chung, Kai-Min, Pettie, Seth, Su, Hsin-Hao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2017 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!