Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex coloring of graphs with few obstructions / rank | |||
Normal rank | |||
Latest revision as of 00:07, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation algorithms for the coloring problem in some cases |
scientific article |
Statements
Polynomial-time approximation algorithms for the coloring problem in some cases (English)
0 references
22 June 2017
0 references
coloring problem
0 references
computational complexity
0 references
approximation algorithm
0 references
performance guarantee
0 references
