5 citations · 12 across the 4 of their papers we have counts for
1 paper · 1 filter
Tapani Toivonen, Janne Karttunen
MAX CLIQUE problem (MCP) is an NPO problem, which asks to find the largest complete sub-graph in a graph G,G=(V,E) (directed or undirected). MCP is well known to be NP−Hard…