Clique enumeration seeks to list all complete subgraphs within a larger network, a task central to understanding cohesive structures in domains as diverse as social science, bioinformatics and ...

Clique relaxation problems are important extension versions of the maximum clique problem with extensive real-world applications. Although lots of studies focus on designing local search algorithms ...

Graph-theoretic problems of identifying maximum cliques and maximum independent sets occupy a central place in combinatorial optimisation and theoretical computer science. A clique is a set of ...