Exact k-Clique (Clique Problems)

From Algorithm Wiki
Revision as of 08:22, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


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


$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.