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 cs.DSShow all

1 paper · 1 filter

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…