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 ...

Densest subgraph discovery algorithms form a vital field of research within graph theory and data mining, aiming to identify highly interconnected subsets within larger networks. These methods extend ...