Hamiltonian(t)-an ant-inspired heuristic for recognizing Hamiltonian graphs.

Israel A. Wagner Alfred M. Bruckstein

Published in: CEC (1999)

Keyphrases

graph coloring
graph matching
optimal solution
weighted graph
dynamic programming
scheduling problem
constraint satisfaction
graph theory
ant colony
evolutionary algorithm
graph model