20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

The Hamiltonian Circuit Algorithm - Ashay Dharwadker

English
2004-08-08
€19.46 €24.33

-20% with code BOOKS

In stock at our supplier

Shipping in 10-16 days

30-day return policy

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 ( ... Full description

You May Also Like

Description

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.

More Information

Author Ashay Dharwadker
Publisher Institute of Mathematics
Release year 2004
Cover type Softcover
EAN 9781466381377
Write Your Own Review
You're reviewing: The Hamiltonian Circuit Algorithm
Your Rating:

Goodreads Reviews

€19.46 €24.33