An approximate algorithm for the chromatic number of graphs (Q283679): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2014.08.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024831296 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 3-coloring in time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic graph theory and perfect graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs, Algorithms, and Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4530616 / rank | |||
Normal rank | |||
Latest revision as of 23:26, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximate algorithm for the chromatic number of graphs |
scientific article |
Statements
An approximate algorithm for the chromatic number of graphs (English)
0 references
13 May 2016
0 references
graph coloring
0 references
approximation algorithm
0 references
chromatic number
0 references
