Geodesic
Enumerating Hamiltonian cycles
Ville H. Pettersson1
1Aalto University
The electronic journal of combinatorics, Tome 21 (2014) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/4510
Classification : 05C30, 05C38, 05C45, 05C85, 90C39, 90C35
Mots-clés : Hamiltonian cycles, enumeration, dynamic programming

Ville H. Pettersson  1

1 Aalto University 
@article{10_37236_4510,
     author = {Ville H. Pettersson},
     title = {Enumerating {Hamiltonian} cycles},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {4},
     doi = {10.37236/4510},
     zbl = {1298.05164},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4510/}
}
TY  - JOUR
AU  - Ville H. Pettersson
TI  - Enumerating Hamiltonian cycles
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4510/
DO  - 10.37236/4510
ID  - 10_37236_4510
ER  - 
%0 Journal Article
%A Ville H. Pettersson
%T Enumerating Hamiltonian cycles
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/4510/
%R 10.37236/4510
%F 10_37236_4510
Ville H. Pettersson. Enumerating Hamiltonian cycles. The electronic journal of combinatorics, Tome 21 (2014) no. 4. doi: 10.37236/4510

Cité par Sources :