Enhanced prim's algorithm for finding the hamiltonian cycle in a graph

• 第一著者: Dinon, Nur Atiqah
• フォーマット: 学位論文
• 言語: English
• 出版事項: 2013
• 主題: QA Mathematics
• オンライン･アクセス: http://eprints.utm.my/id/eprint/48195/1/NurAtiqahDinonMFS2013.pdf; http://eprints.utm.my/id/eprint/48195/; http://libraryopac.utm.my/client/en_AU/main/search/results?qu=Enhanced+prim%27s+algorithm+for+finding+the+hamiltonian+cycle+in+a+graph&te=

The Travelling Salesman Problem (TSP) is known as one of the oldest combinatorial optimisation problem which solves the path problem in weighted graph. With the main objective to visiting all places (nodes) in a round trip that start and end in one specific place, TSP shared the same problem with a...