Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657)
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 6365539
| 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 6365539 |
Statements
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (English)
0 references
4 November 2014
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 references
0.93772596
0 references
0.9160925
0 references
0.91064036
0 references
0.8996062
0 references
0.89532256
0 references
0.8928975
0 references
0.8870406
0 references
