An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width.

Benjamin Bergougnoux Mamadou Moustapha Kanté O-joung Kwon

Published in: CoRR (2017)

Keyphrases

hamiltonian cycle
dynamic programming
learning algorithm
cost function
optimal solution
computational complexity
search space
np hard
linear programming
simulated annealing
phase transition
optimal strategy
bin packing
maximum clique