A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-015-9862-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9862-1 / rank | |||
Normal rank | |||
Revision as of 15:38, 8 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations |
scientific article |
Statements
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (English)
0 references
11 May 2016
0 references
graph colouring
0 references
heuristic
0 references
bitwise operations
0 references
greedy algorithm
0 references
sequential colouring
0 references
