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 ...
1 Introduction Max-Clique (MC) is an NP-hard combinatorial problem disguised as something that looks like a child’s game. Any set of interconnected nodes in a graph are called a clique. Max-Clique ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results