An exact algorithm for the maximum k-club problem in an undirected graph

Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant. An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research, 138(1):21-28, 2002. [doi]

@article{BourjollyLP02,
  title = {An exact algorithm for the maximum k-club problem in an undirected graph},
  author = {Jean-Marie Bourjolly and Gilbert Laporte and Gilles Pesant},
  year = {2002},
  doi = {10.1016/S0377-2217(01)00133-3},
  url = {http://dx.doi.org/10.1016/S0377-2217(01)00133-3},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BourjollyLP02},
  cites = {0},
  citedby = {0},
  journal = {European Journal of Operational Research},
  volume = {138},
  number = {1},
  pages = {21-28},
}