1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2013★ 1 cited
On the Complexity of Maximum Clique Algorithms: usage of coloring heuristics leads to the 2^(n\5) algorithm running time lower bound
Nikolay Lavnikevich
Maximum Clique Problem(MCP) is one of the 21 original NP--complete problems enumerated by Karp in 1972. In recent years a large number of exact methods to solve MCP have been appea…