Clique algorithm
Date of Publication
2008
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with Specialization in Computer Applications
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Severino V. Gervacio
Defense Panel Chair
Leonor A. RuivivarA
Defense Panel Member
Alana Margarita R. Hernandez
Ederlina G. Nocon
Abstract/Summary
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.
Abstract Format
html
Language
English
Format
Accession Number
TU15408
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
v, 78 leaves, illustrations, 28 cm.
Keywords
Graph theory
Recommended Citation
Tan, M. N., & Tan, M. N. (2008). Clique algorithm. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/5055
Embargo Period
3-29-2021
