A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs.

Eythan Levy Guy Louchard Jordi Petit

Published in: CAAN (2004)

Keyphrases

random graphs
optimal solution
dynamic programming
learning algorithm
computational complexity
worst case
search space
k means
simulated annealing
undirected graph
graph theoretic