Enumerating Hamiltonian Cycles
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 easil...
Saved in:
| Published in: | The Electronic journal of combinatorics Vol. 21; no. 4 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
09-10-2014
|
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1077-8926 1077-8926 |
| DOI: | 10.37236/4510 |