Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

The Hamiltonian Circuit Algorithm - Ashay Dharwadker

englanti
2004-08-08
18,41 € 24,55 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 10-16 arkipäivässä

30 päivän palautusoikeus

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 ( ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Ashay Dharwadker
Julkaisija Institute of Mathematics
Julkaisuvuosi 2004
Kannen tyyppi Pehmeäkantinen
EAN 9781466381377
Kirjoita oma arvostelusi
Arvostelet: The Hamiltonian Circuit Algorithm
Arvostelusi:

Goodreads-arvostelut

18,41 € 24,55 €