Enumerating Hamiltonian Cycles
Copyright policy )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 easily be modified to enumerate hamiltonian paths and other similar structures.
- Aalto University Finland
dynamic programming, ta113, Eulerian and Hamiltonian graphs, ta213, ta111, Programming involving graphs or networks, Enumeration in graph theory, Dynamic programming, Hamiltonian cycles, enumeration, Graph algorithms (graph-theoretic aspects), Paths and cycles, ta512
dynamic programming, ta113, Eulerian and Hamiltonian graphs, ta213, ta111, Programming involving graphs or networks, Enumeration in graph theory, Dynamic programming, Hamiltonian cycles, enumeration, Graph algorithms (graph-theoretic aspects), Paths and cycles, ta512
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!