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

Full description

Bibliographic Details
Main Author: Dinon, Nur Atiqah (Author)
Format: Thesis
Published: 2013-01.
Subjects:
Online Access:Get fulltext