scholarly journals Enumerating Hamiltonian Cycles

10.37236/4510 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Ville H. Pettersson
Keyword(s):  
Dynamic Programming ◽  
Three Dimensional ◽  
Programming Method ◽  
Hamiltonian Cycles ◽  
Dynamic Programming Method ◽  
Hamiltonian Paths ◽  
Grid Graphs ◽  
Triangular Grids ◽  
Arbitrary Graphs

A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king's graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published. The approach can easily be modified to enumerate hamiltonian paths and other similar structures.

Sign in / Sign up

Export Citation Format

Share Document