Finding Hamiltonian cycles: An algorithm
Dirac's famous theorems states that If G is a graph of order () 3 such that the minimum degree (), then G is Hamiltonian. This paper presents a constructive proff of this theorem based on the C++ algorithm that finds a Hamiltonian cycle given the same conditions as the theorem. In addition, the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/5054 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-5624 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-56242021-03-30T02:50:52Z Finding Hamiltonian cycles: An algorithm Macapagal, Rachel R. Tan, Mary Jane T. Dirac's famous theorems states that If G is a graph of order () 3 such that the minimum degree (), then G is Hamiltonian. This paper presents a constructive proff of this theorem based on the C++ algorithm that finds a Hamiltonian cycle given the same conditions as the theorem. In addition, the complexity of the algorithm was also examined to evaluate if the algorithm is a P-problem or NP-problem class.Mainly, this paper is an exposition of the article A New Algorithm For Finding Hamiltonian Circuits by Ashay Dharwadker." 2008-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/5054 Bachelor's Theses English Animo Repository Hamiltonian graph theory Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Hamiltonian graph theory Mathematics |
| spellingShingle |
Hamiltonian graph theory Mathematics Macapagal, Rachel R. Tan, Mary Jane T. Finding Hamiltonian cycles: An algorithm |
| description |
Dirac's famous theorems states that If G is a graph of order () 3 such that the minimum degree (), then G is Hamiltonian. This paper presents a constructive proff of this theorem based on the C++ algorithm that finds a Hamiltonian cycle given the same conditions as the theorem. In addition, the complexity of the algorithm was also examined to evaluate if the algorithm is a P-problem or NP-problem class.Mainly, this paper is an exposition of the article A New Algorithm For Finding Hamiltonian Circuits by Ashay Dharwadker." |
| format |
text |
| author |
Macapagal, Rachel R. Tan, Mary Jane T. |
| author_facet |
Macapagal, Rachel R. Tan, Mary Jane T. |
| author_sort |
Macapagal, Rachel R. |
| title |
Finding Hamiltonian cycles: An algorithm |
| title_short |
Finding Hamiltonian cycles: An algorithm |
| title_full |
Finding Hamiltonian cycles: An algorithm |
| title_fullStr |
Finding Hamiltonian cycles: An algorithm |
| title_full_unstemmed |
Finding Hamiltonian cycles: An algorithm |
| title_sort |
finding hamiltonian cycles: an algorithm |
| publisher |
Animo Repository |
| publishDate |
2008 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/5054 |
| _version_ |
1772834595657482240 |