Discovering Robustly Connected Subgraphs with Simple Descriptions

Janis Kalofolias, Mario Boley, Jilles Vreeken. Discovering Robustly Connected Subgraphs with Simple Descriptions. In Jianyong Wang, Kyuseok Shim, Xindong Wu 0001, editors, 2019 IEEE International Conference on Data Mining, ICDM 2019, Beijing, China, November 8-11, 2019. pages 1150-1155, IEEE, 2019. [doi]

@inproceedings{KalofoliasBV19,
  title = {Discovering Robustly Connected Subgraphs with Simple Descriptions},
  author = {Janis Kalofolias and Mario Boley and Jilles Vreeken},
  year = {2019},
  doi = {10.1109/ICDM.2019.00139},
  url = {https://doi.org/10.1109/ICDM.2019.00139},
  researchr = {https://researchr.org/publication/KalofoliasBV19},
  cites = {0},
  citedby = {0},
  pages = {1150-1155},
  booktitle = {2019 IEEE International Conference on Data Mining, ICDM 2019, Beijing, China, November 8-11, 2019},
  editor = {Jianyong Wang and Kyuseok Shim and Xindong Wu 0001},
  publisher = {IEEE},
  isbn = {978-1-7281-4604-1},
}