most citedOn the Complexity of Maximum Clique Algorithms: usage of coloring heuristics leads to the 2^(n\5) algorithm running time lower bound

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2017

(1, k)-Swap Local Search for Maximum Clique Problem

Lavnikevich Nikolay

Given simple undirected graph G = (V, E), the Maximum Clique Problem(MCP) is that of finding a maximum-cardinality subset Q of V such that any two vertices in Q are adjacent. We pr…