Exact k-Clique (Clique Problems)
Jump to navigation Jump to search
Given a graph $G = (V, E)$, find a $k$-clique of weight 0.
$n$: number of vertices
$m$: number of edges
$k$: size of clique
Table of Algorithms
Currently no algorithms in our database for the given problem.