Exact k-Clique

Given a graph $G = (V, E)$ , find a $k$ -clique of weight 0.

Parameters

$n$ : number of vertices
$m$ : number of edges
$k$ : size of clique

Related Problems

Enumerating Maximal Cliques, arbitrary graph

Enumerating k-Cliques

Max-Weight Clique

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table