Login / Signup
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations.
Larisa Komosko
Mikhail Batsyn
Pablo San Segundo
Panos M. Pardalos
Published in:
J. Comb. Optim. (2016)
Keyphrases
</>
greedy heuristic
search algorithm
greedy search
minimum weight
greedy algorithms
dynamic programming
hill climbing
optimal solution
greedy algorithm
search space
locally optimal
forward selection
data sets
directed graph
simulated annealing
heuristic methods
lower bound
heuristic solution
learning algorithm