Exact k-Clique: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Exact k-Clique (Clique Problems)}} == 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 == <pre>n: number of vertices k: size of clique</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem.") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of vertices | |||
k: size of clique | |||
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. | ||
Revision as of 12:02, 15 February 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
k: size of clique
Table of Algorithms
Currently no algorithms in our database for the given problem.