Login / Signup
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.
Benjamin Bergougnoux
Mamadou Moustapha Kanté
O-joung Kwon
Published in:
Algorithmica (2020)
Keyphrases
</>
hamiltonian cycle
dynamic programming
objective function
computational complexity
cost function
traveling salesman problem
graph coloring
learning algorithm
optimization algorithm
optimal solution
np hard
markov chain
ant colony optimization
phase transition
search space