Coloring nonuniform hypergraphs: a new algorithmic approach to the general Lovász local lemma

Authors:
Artur Czumaj;Christian Schiedeler
Affiliations:
-;-
Venue:
Proceedings of the ninth international conference on on Random structures and algorithms
Year:
2000

Citing 0
Cited 4

Testing hypergraph colorability

Theoretical Computer Science - Automata, languages and programming
Edge Colouring with Delays

Combinatorics, Probability and Computing
Improved algorithmic versions of the Lovász Local Lemma

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Conflict-free colourings of graphs and hypergraphs

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract