Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372)
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 6559785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and almost tight results for 3-colorability of small diameter graphs |
scientific article; zbMATH DE number 6559785 |
Statements
Algorithms and almost tight results for 3-colorability of small diameter graphs (English)
0 references
23 March 2016
0 references
3-coloring
0 references
graph diameter
0 references
graph radius
0 references
subexponential algorithm
0 references
NP-complete
0 references
exponential time hypothesis
0 references
0.986583411693573
0 references
0.9189725518226624
0 references
0.8249622583389282
0 references
0.8184970617294312
0 references
0.7706122994422913
0 references
