An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195)
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 6588281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs |
scientific article; zbMATH DE number 6588281 |
Statements
An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (English)
0 references
1 June 2016
0 references
graph coloring
0 references
approximation algorithms
0 references
analysis of algorithms
0 references
0.9006966352462769
0 references
0.9001944661140442
0 references
0.9001944661140442
0 references
0.8830558657646179
0 references
0.8830558657646179
0 references
