Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma |
scientific article; zbMATH DE number 1545674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma |
scientific article; zbMATH DE number 1545674 |
Statements
8 July 2001
0 references
Lovász local lemma
0 references
randomized algorithm
0 references
expected linear time
0 references
vertex coloring
0 references
hypergraph
0 references
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (English)
0 references
0.9414122
0 references
0.92746377
0 references
0.91141343
0 references
0 references
0.8961208
0 references
0.89496624
0 references
0.89419997
0 references
