On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223)
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: On algorithmic methods of analysis of two-colorings of hypergraphs |
scientific article; zbMATH DE number 6589768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On algorithmic methods of analysis of two-colorings of hypergraphs |
scientific article; zbMATH DE number 6589768 |
Statements
On algorithmic methods of analysis of two-colorings of hypergraphs (English)
0 references
7 June 2016
0 references
hypergraph colorings
0 references
0 references
0.9286965727806092
0 references
0.8783181309700012
0 references
0.85875403881073
0 references
0.8499746322631836
0 references
0.8466876149177551
0 references
