Now showing items 1-1 of 1
A conceptual heuristic for solving the maximum clique problem
(Computing, 2017 , Thesis)
The maximum clique problem (MCP) is the problem of finding the clique with maximum cardinality in a graph. It has been intensively studied for years by computer scientists and mathematicians. It has many practical applications ...