A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6579250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations |
scientific article; zbMATH DE number 6579250 |
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
0.8121224045753479
0 references
0.8086990714073181
0 references
0.7819218039512634
0 references
