An Exhaustive Search Algorithm for Finding Hamiltonian Cycles

Dainis Zeps (1)

1 IMCS - Institute of Mathematics and Computer Science

The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on the idea not to search all palms in the graphs but only those which are not branched. Tutte's 46 vertices graph searching took less than 3 minutes on EC- 1022 computer.

Mots clés: algorithm to find Hamiltonian cycle; depth first search

Domaines: Combinatoire [math.CO]

Dainis Zeps. An Exhaustive Search Algorithm for Finding Hamiltonian Cycles. Elektronische Informationsverarbeitung und Kybernetik, EIK, 1980, 16 (1-3), pp.69-75. ⟨hal-00426842⟩