Exact k-Clique (Clique Problems)
Jump to navigation
Jump to search
Description
Given a graph $G = (V, E)$, find a $k$-clique of weight 0.
Related Problems
Generalizations: k-Clique
Related: Enumerating Maximal Cliques, arbitrary graph, Min-Weight k-Clique, Max-Weight k-Clique
Parameters
$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.