A game-theoretic approach to partial clique enumeration

@article{Bul2009AGA,
  title={A game-theoretic approach to partial clique enumeration},
  author={Samuel Rota Bul{\`o} and Andrea Torsello and Marcello Pelillo},
  journal={Image Vision Comput.},
  year={2009},
  volume={27},
  pages={911-922}
}
In many computer vision and pattern recognition applications using graph-based representations, it is of great interest to be able to extract the k largest cliques in a graph. However, most methods are geared either towards extracting a single clique of maximum size, or enumerating all cliques, without following any particular order. In this paper, we present a novel approach for partial clique enumeration, which is the problem of extracting the k largest cliques of a graph. Our approach is… CONTINUE READING