The densest k-subgraph problem on clique graphs

  title={The densest k-subgraph problem on clique graphs},
  author={Maria Liazi and Ioannis Milis and Fanny Pascual and Vassilis Zissimopoulos},
  journal={J. Comb. Optim.},
The Densest k-Subgraph (DkS) problem asks for a k-vertex subgraph of a given graph with the maximum number of edges. The problem is strongly NP-hard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In this paper we focus on special cases of the problem, with respect to the class of the input graph. Especially, towards the elucidation of the open questions concerning the complexity of the problem for… CONTINUE READING