Clique algorithm
The paper aims to find the maximum clique in a graph. The ideas presented here are important because it is difficult to find the maximum clique in larger graphs manually therefore implementing a software is highly recommended. The software created by Dhardwarker and Tan and Tan were both developed i...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/5055 |
| 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-5623 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-56232021-03-30T02:46:17Z Clique algorithm Tan, Marjovin N. Tan, Marc Andrew N. The paper aims to find the maximum clique in a graph. The ideas presented here are important because it is difficult to find the maximum clique in larger graphs manually therefore implementing a software is highly recommended. The software created by Dhardwarker and Tan and Tan were both developed in C++ technology. Tan and Tan algorithm is better than Dhardwarker's algorithm because Tan and Tan algorithm is efficient, simple, fast to finish, accurate and easy to use. After extensive research, we found a certain graph for which Dhardwardker's algorithm does not get the maximum clique. On the other hand, our algorithm gives the correct maximum clique. 2008-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/5055 Bachelor's Theses English Animo Repository 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 |
Graph theory Mathematics |
| spellingShingle |
Graph theory Mathematics Tan, Marjovin N. Tan, Marc Andrew N. Clique algorithm |
| description |
The paper aims to find the maximum clique in a graph. The ideas presented here are important because it is difficult to find the maximum clique in larger graphs manually therefore implementing a software is highly recommended. The software created by Dhardwarker and Tan and Tan were both developed in C++ technology. Tan and Tan algorithm is better than Dhardwarker's algorithm because Tan and Tan algorithm is efficient, simple, fast to finish, accurate and easy to use. After extensive research, we found a certain graph for which Dhardwardker's algorithm does not get the maximum clique. On the other hand, our algorithm gives the correct maximum clique. |
| format |
text |
| author |
Tan, Marjovin N. Tan, Marc Andrew N. |
| author_facet |
Tan, Marjovin N. Tan, Marc Andrew N. |
| author_sort |
Tan, Marjovin N. |
| title |
Clique algorithm |
| title_short |
Clique algorithm |
| title_full |
Clique algorithm |
| title_fullStr |
Clique algorithm |
| title_full_unstemmed |
Clique algorithm |
| title_sort |
clique algorithm |
| publisher |
Animo Repository |
| publishDate |
2008 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/5055 |
| _version_ |
1772834505143353344 |