Exact k-Clique: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of vertices | $n$: number of vertices | ||
k: size of clique | $m$: number of edges | ||
$k$: size of clique | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 08:22, 10 April 2023
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.