Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633)
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: Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs |
scientific article; zbMATH DE number 7458785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs |
scientific article; zbMATH DE number 7458785 |
Statements
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (English)
0 references
18 January 2022
0 references
hypergraph coloring
0 references
hypergraph dualization
0 references
exact algorithms
0 references
quasi-polynomial algorithm
0 references
list coloring
0 references
0 references
0.94153845
0 references
0 references
0.8807748
0 references
0.8749563
0 references
0.87495095
0 references
0.87495095
0 references
0.8748871
0 references
0.8734762
0 references
