The k-densest Subgraph Problem in Pairwise Overlapping Cliques - Archive ouverte HAL Access content directly
Journal Articles Journal of Combinatorial Optimization Year : 2007

The k-densest Subgraph Problem in Pairwise Overlapping Cliques

Maria Liazi
  • Function : Author
Ioannis Milis
  • Function : Author
Fanny Pascual
  • Function : Author
  • PersonId : 855950
Vassilis Zissimopoulos
  • Function : Author

Abstract

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 interval graphs as well as its approximability for chordal graphs, we consider graphs having special clique graphs. We present a PTAS for stars of cliques and a dynamic programming algorithm for trees of cliques.

Dates and versions

hal-01185218 , version 1 (19-08-2015)

Identifiers

Cite

Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos. The k-densest Subgraph Problem in Pairwise Overlapping Cliques. Journal of Combinatorial Optimization, 2007, 14 (4), pp.465-474. ⟨10.1007/s10878-007-9069-1⟩. ⟨hal-01185218⟩
84 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More