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/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
著者:: Dinon, Nur Atiqah
出版事項: (2013) -
Hamiltonian polygonal path in assembly graph of FTTM
著者:: Ahmad, T., 等
出版事項: (2019) -
Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
著者:: Wamiliana, Wamiliana, 等
出版事項: (2015) -
Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
著者:: Maizon, Mohd Darus
出版事項: (2015) -
On Cyclic Near-Hamiltonian Cycle System of the Complete
Multigraph
著者:: Aldiabat, Raja'i, 等
出版事項: (2017)