摘要：AbstractThis paper addresses a variant of the classical clique problem in which the edges of the graph are labeled. The problem consists of finding a clique as large as possible whose edge set contains at mostb ∈ Z+different labels. Moreover, in case of more feasible cliques of the same maximum size, we look for the one with the minimum number of labels. We study the time complexity of the problem, also in special cases, and we propose a mathematical programming approach for its solution by introducing two different formulations: the basic and the enforced. We experimentally evaluate the performance of the proposed approach on a set of benchmark instances (DIMACS) suitably adapted to the problem.
