|
Abstract
|
|
|---|---|
| In this paper a fast greedy sequential heuristic for the vertex colouring problem is presented. The suggested algorithm builds the same colouring of the graph as the well-known greedy sequential heuristic in which on every step the current vertex is coloured in the minimum possible colour. Our main contributions include introduction of a special matrix of forbidden colours and application of efficient bitwise operations on bit representations of the adjacency and forbidden colours matrices. Computational experiments show that in comparison with the classical greedy heuristic the average speedup of the developed approach is 2.6 times on DIMACS instances. | |
|
International
|
Si |
|
JCR
|
Si |
|
Title
|
Journal of Combinatorial Optimization |
|
ISBN
|
1382-6905 |
|
Impact factor JCR
|
1,043 |
|
Impact info
|
Q2, Datos JCR del año 2013 |
|
Volume
|
|
|
|
10.1007/s10878-015-9862-1 |
|
Journal number
|
31 |
|
From page
|
1665 |
|
To page
|
1677 |
|
Month
|
MARZO |
|
Ranking
|
Q2, Area: MATHEMATICS APPLIED (81/254) (datos 2015) |