Skip to main content

Research Repository

Advanced Search

Analysis of an iterated greedy heuristic for vertex clique covering (2018)
Journal Article
Chalupa, D., & PospĂ­chal, J. (2018). Analysis of an iterated greedy heuristic for vertex clique covering. Computing and Informatics, 37(2), 385-404. https://doi.org/10.4149/cai_2018_2_385

The aim of the vertex clique covering problem (CCP) is to cover the vertices of a graph with as few cliques as possible. We analyse the iterated greedy (IG) algorithm for CCP, which was previously shown to provide strong empirical results for real-wo... Read More about Analysis of an iterated greedy heuristic for vertex clique covering.

Computational methods for finding long simple cycles in complex networks (2017)
Journal Article
Chalupa, D., Balaghan, P., Hawick, K. A., & Gordon, N. A. (2017). Computational methods for finding long simple cycles in complex networks. Knowledge-Based Systems, 125, 96-107 . https://doi.org/10.1016/j.knosys.2017.03.022

© 2017 Elsevier B.V. Detection of long simple cycles in real-world complex networks finds many applications in layout algorithms, information flow modelling, as well as in bioinformatics. In this paper, we propose two computational methods for findin... Read More about Computational methods for finding long simple cycles in complex networks.