Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

The Hamiltonian Circuit Algorithm - Ashay Dharwadker

Anglų
2004-08-08
18,41 € 24,55 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 10-16 d.d.

30 dienų grąžinimo politika

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 ( ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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.

Daugiau informacijos

Autorius Ashay Dharwadker
Leidėjas Institute of Mathematics
Išleidimo metai 2004
Viršelio tipas Minkšti viršeliai
EAN 9781466381377
Parašykite savo atsiliepimą
Jūs peržiūrėjote: The Hamiltonian Circuit Algorithm
Jūsų įvertinimas:

Goodreads Atsiliepimai

18,41 € 24,55 €