Multipass greedy coloring of simple uniform hypergraphs (Q3467582)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6538880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multipass greedy coloring of simple uniform hypergraphs |
scientific article; zbMATH DE number 6538880 |
Statements
Multipass greedy coloring of simple uniform hypergraphs (English)
0 references
3 February 2016
0 references
hypergraph coloring
0 references
greedy algorithm
0 references
van der Waerden numbers
0 references
0 references
0.8758136630058289
0 references
0.8593886494636536
0 references
0.8588257431983948
0 references
0.8443074226379395
0 references
0.8437361717224121
0 references
