Hamiltonian Graphs and the Traveling Salesman Problem

Details Hamiltonian Graphs and the Traveling Salesman Problem Hamiltonian Graphs and the Traveling Salesman Problem

2007-04-27

arxiv.org/abs/0704.3672v5

Mathematics

General Mathematics

18 pages. An algorithm for traveling salesman going around real cities is added as section 2.5

Scientific paper

A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. A new exact polynomial time algorithm for the traveling salesman problem (TSP) based on this new characterization is developed. A new characterization of shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed.

Affiliated with

Also associated with

No associations

Rating

Hamiltonian Graphs and the Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamiltonian Graphs and the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamiltonian Graphs and the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-677170