Algorithmic approaches for maximum clique problem
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
The Maximum Clique Problem is much studied graph theory optimization problem in operation research field, and it belongs to the class of NP-Complete. The problem has widespread field of application in many areas. Besides, the problem is closely related to many graph theory problems. Thus, the maximum clique problem plays an important role in computer science field. In this thesis, the maximum clique problem is studied, the solution approaches for the problem in literature are investigated and a new hybrid genetic algorithm have been proposed for the problem. The proposed algorithm has been implemented in Java and has been tested on the DIMACS and BHOSLIB benchmark instances, the results have been compared with similar studies the literature works. The experimental results show that proposed algorithm is effective.
Author
Gözde Kızılateş Evin
Institution
How to Cite
Gözde Kızılateş Evin (Doctorate thesis). Algorithmic approaches for maximum clique problem, 2019, Ege University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Ege University
- Increasing the fertilization yield of trout eggs(2013)
- The investigation of colorimetric capnometry events in the correct placement of nasogastric tube(2015)
- Effect of self-efficacy of children and adolescents with asthma on their quality of life(2015)
- Two "Âşık" in the city environment: Maksut Koca and Nevruz Ali̇ Çi̇çek(2015)
- Blood use standardization according to risk score on congenital heart surgery(2015)
- Effect of microfibers on mechanical and durability properties of cement mortar mixtures(2015)