Min-Weight k-Clique

Given a graph G=(V,E)G = (V, E), find the kk-clique of minimum weight.

Parameters

  • nn: number of vertices
  • mm: number of edges
  • kk: size of clique

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 2 of 2 reductions

Other relevant algorithms

Insuffient Data to display table