Finding Hamiltonian Cycles
Finding a Hamiltonian cycle in a graph is used for solving major problems in areas such as graph theory, computer networks, and algorithm design. In this thesis various approaches of Hamiltonian cycle algorithms such as backtrack algorithms and heuristic algorithms, their basic ideas, and their actu...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
TopSCHOLAR®
2005
|
| Subjects: | |
| Online Access: | http://digitalcommons.wku.edu/theses/504 http://digitalcommons.wku.edu/cgi/viewcontent.cgi?article=1507&context=theses |