The Complexity of Near-Optimal Graph Coloring (Q4083458): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/321921.321926 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025904765 / rank | |||
Normal rank | |||
Latest revision as of 18:21, 19 March 2024
scientific article; zbMATH DE number 3503280
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Near-Optimal Graph Coloring |
scientific article; zbMATH DE number 3503280 |
Statements
The Complexity of Near-Optimal Graph Coloring (English)
0 references
1976
0 references
