Enumerating Hamiltonian cycles (Q463046)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumerating Hamiltonian cycles |
scientific article; zbMATH DE number 6360682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating Hamiltonian cycles |
scientific article; zbMATH DE number 6360682 |
Statements
Enumerating Hamiltonian cycles (English)
0 references
23 October 2014
0 references
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.
0 references
Hamiltonian cycles
0 references
enumeration
0 references
dynamic programming
0 references
0 references
0.8520776629447937
0 references
0.828090250492096
0 references
0.8259055018424988
0 references
0.8228297829627991
0 references
