Sub-exponential graph coloring algorithm for stencil-based Jacobian computations.

Michael Lülfesmann Ken-ichi Kawarabayashi

Published in: J. Comput. Sci. (2014)

Keyphrases

graph coloring
computational complexity
randomly generated
objective function
optimal solution
np hard
dynamic programming
bin packing
learning algorithm
knapsack problem
min max
benchmark problems
particle swarm optimization
max sat
combinatorial optimization
hamiltonian cycle
distributed breakout