期刊论文详细信息
| Electronic Journal Of Combinatorics | |
| Enumerating Hamiltonian Cycles | |
| Ville H. Pettersson1 | |
| 关键词: Hamiltonian cycles; Enumeration; Dynamic Programming; | |
| DOI : | |
| 学科分类：离散数学和组合数学 | |
| 来源: Electronic Journal Of Combinatorics | |
 PDF
|
|
【 摘 要 】
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 prev【 授权许可】
Others
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201909020819857ZK.pdf | 278KB |  download |
878987797
028-85220240
