An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3337223 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New approximation algorithms for graph coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved non-approximability results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate graph coloring by semidefinite programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ramsey numbers and an approximation algorithm for the vertex cover problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improving the performance guarantee for approximate graph coloring / rank | |||
Normal rank | |||
Revision as of 01:56, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs |
scientific article |
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
