Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
label / en | label / en | ||
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma | |||
Property / cites work | |||
Property / cites work: A parallel algorithmic version of the local lemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithmic approach to the Lovász local lemma. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4527020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient approximation of product distributions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Colouring a graph frugally / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252343 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4542572 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4242948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326389 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4875163 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/1098-2418(200010/12)17:3/4<213::aid-rsa3>3.0.co;2-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000992447 / rank | |||
Normal rank | |||
Property / title | |||
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (English) | |||
Property / title: Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (English) / rank | |||
Normal rank |
Latest revision as of 11:54, 30 July 2024
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