An Exhaustive Search Algorithm for Finding Hamiltonian Cycles
Zeps, Dainis
HAL, hal-00426842 / Harvested from HAL
Text on HAL
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.
Publié le : 1980-03-31
Classification:  algorithm to find Hamiltonian cycle,  depth first search,  ACM Graph Theory: G.2.2,  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00426842,
     author = {Zeps, Dainis},
     title = {An Exhaustive Search Algorithm for Finding Hamiltonian Cycles},
     journal = {HAL},
     volume = {1980},
     number = {0},
     year = {1980},
     language = {ru},
     url = {http://dml.mathdoc.fr/item/hal-00426842}
}

Zeps, Dainis. An Exhaustive Search Algorithm for Finding Hamiltonian Cycles. HAL, Tome 1980 (1980) no. 0, . http://gdmltest.u-ga.fr/item/hal-00426842/