As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs

Bogdanov et al. "As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40988-2_34

[Bogdanov et al. "As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/bogdanov2013ecmlpkdd-strong/) doi:10.1007/978-3-642-40988-2_34

@inproceedings{bogdanov2013ecmlpkdd-strong,
  title     = {{As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs}},
  author    = {Bogdanov, Petko and Baumer, Ben and Basu, Prithwish and Bar-Noy, Amotz and Singh, Ambuj K.},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2013},
  pages     = {525-540},
  doi       = {10.1007/978-3-642-40988-2_34},
  url       = {https://mlanthology.org/ecmlpkdd/2013/bogdanov2013ecmlpkdd-strong/}
}