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

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...

詳細記述

保存先:
書誌詳細
第一著者: Dinon, Nur Atiqah
フォーマット: 学位論文
言語:English
出版事項: 2013
主題:
オンライン・アクセス:http://eprints.utm.my/id/eprint/47935/25/NurAtiqahDinonMFS2013.pdf
http://eprints.utm.my/id/eprint/47935/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料