The Hamiltonian Circuit Algorithm
aug 2004 · Institute of Mathematics
5,0star
1 arvustusreport
E-raamat
36
lehekülge
reportHinnangud ja arvustused pole kinnitatud. Lisateave
Teave selle e-raamatu kohta
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.
Hinnangud ja arvustused
5,0
1 arvustus
Teave autori kohta
Ashay Dharwadker is the Distinguished Professor of Mathematics & Natural Sciences at the Institute of Mathematics, Gurgaon, India. He is the author of a dozen exquisitely illustrated books describing his fundamental contributions to combinatorics, graph theory, computer science and the foundations of physics.
Hinnake seda e-raamatut
Andke meile teada, mida te arvate.
Lugemisteave
Nutitelefonid ja tahvelarvutid
Installige rakendus Google Play raamatud Androidile ja iPadile/iPhone'ile. See sünkroonitakse automaatselt teie kontoga ja see võimaldab teil asukohast olenemata lugeda nii võrgus kui ka võrguühenduseta.
Sülearvutid ja arvutid
Google Playst ostetud audioraamatuid saab kuulata arvuti veebibrauseris.
E-lugerid ja muud seadmed
E-tindi seadmetes (nt Kobo e-lugerid) lugemiseks peate faili alla laadima ja selle oma seadmesse üle kandma. Failide toetatud e-lugeritesse teisaldamiseks järgige üksikasjalikke abikeskuse juhiseid.
