The densest ::::k::::-subgraph problem on clique graphs

Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos. The densest ::::k::::-subgraph problem on clique graphs. J. Comb. Optim., 14(4):465-474, 2007. [doi]

@article{LiaziMPZ07,
  title = {The densest ::::k::::-subgraph problem on clique graphs},
  author = {Maria Liazi and Ioannis Milis and Fanny Pascual and Vassilis Zissimopoulos},
  year = {2007},
  doi = {10.1007/s10878-007-9069-1},
  url = {http://dx.doi.org/10.1007/s10878-007-9069-1},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LiaziMPZ07},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {14},
  number = {4},
  pages = {465-474},
}