University of Twente Student Theses
An empirical evaluation of approximation algorithms to find maximal cliques in hypergraphs
Iosif, A. (2022) An empirical evaluation of approximation algorithms to find maximal cliques in hypergraphs.
|
PDF
471kB |
| Abstract: | In this research, two methods based on the replicator transformation are applied to circulant k-hypergraphs in order to find their maximal cliques. An experiment is conducted on hypergraphs to test the algorithms considering three main parameters in their generation: the edge size k, the edge density d, and the total number of vertices n. The paper shows the relation between these algorithms and the above-mentioned parameters. Specifically, by increasing the edge density, a better time performance of the algorithms is seen. Further, it concludes that the replicator dynamics method is more efficient than the descent method. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Programme: | Computer Science BSc (56964) |
| Link to this item: | https://purl.utwente.nl/essays/89626 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page