The Hamiltonian Circuit Algorithm (Paperback)

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.

General

Imprint:	Createspace Independent Publishing Platform
Country of origin:	United States
Release date:	October 2011
First published:	October 2011
Authors:	Ashay Dharwadker
Dimensions:	280 x 216 x 2mm (L x W x T)
Format:	Paperback - Trade
Pages:	34
ISBN-13:	978-1-4663-8137-7
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Promotions
LSN:	1-4663-8137-X
Barcode:	9781466381377

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!