Createspace Independent Publishing Platform
The Hamiltonian Circuit Algorithm
Product Code:
9781466381377
ISBN13:
9781466381377
Condition:
New
$17.52
The Hamiltonian Circuit Algorithm
$17.52
We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circuit in graphs that have at least three vertices and minimum degree at least half the total number of vertices. In the process, we also obtain a constructive proof of Dirac's famous theorem of 1952, for the first time. The algorithm finds a Hamiltonian circuit (respectively, tour) in all known examples of graphs that have a Hamiltonian circuit (respectively, tour). In view of the importance of the P versus NP question, we ask: does there exist a graph that has a Hamiltonian circuit (respectively, tour) but for which this algorithm cannot find a Hamiltonian circuit (respectively, tour)? The algorithm is implemented in C++ and the program is demonstrated with several examples.
| Author: Ashay Dharwadker |
| Publisher: Createspace Independent Publishing Platform |
| Publication Date: Oct 02, 2011 |
| Number of Pages: 34 pages |
| Binding: Paperback or Softback |
| ISBN-10: 146638137X |
| ISBN-13: 9781466381377 |
Related Products
Sale 9%
