Optimal data reduction for graph coloring using low-degree polynomials (Q5111881)
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: Optimal data reduction for graph coloring using low-degree polynomials |
scientific article; zbMATH DE number 7205206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal data reduction for graph coloring using low-degree polynomials |
scientific article; zbMATH DE number 7205206 |
Statements
27 May 2020
0 references
graph coloring
0 references
kernelization
0 references
sparsification
0 references
0 references
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (English)
0 references
0.9843170046806335
0 references
0.8760055303573608
0 references
0.8726872801780701
0 references
0.770287036895752
0 references
0.764378547668457
0 references
