Finding Dense Subgraphs in Relational Graphs

Jethava and Beerenwinkel. "Finding Dense Subgraphs in Relational Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2015. doi:10.1007/978-3-319-23525-7_39

[Jethava and Beerenwinkel. "Finding Dense Subgraphs in Relational Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2015.](https://mlanthology.org/ecmlpkdd/2015/jethava2015ecmlpkdd-finding/) doi:10.1007/978-3-319-23525-7_39

@inproceedings{jethava2015ecmlpkdd-finding,
  title     = {{Finding Dense Subgraphs in Relational Graphs}},
  author    = {Jethava, Vinay and Beerenwinkel, Niko},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2015},
  pages     = {641-654},
  doi       = {10.1007/978-3-319-23525-7_39},
  url       = {https://mlanthology.org/ecmlpkdd/2015/jethava2015ecmlpkdd-finding/}
}