Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study

Zoltán Tasnádi, Noémi Gaskó. Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study. In Giuseppe Nicosia, Varun Ojha 0001, Emanuele La Malfa, Gabriele La Malfa, Panos M. Pardalos, Renato Umeton, editors, Machine Learning, Optimization, and Data Science - 9th International Conference, LOD 2023, Grasmere, UK, September 22-26, 2023, Revised Selected Papers, Part II. Volume 14506 of Lecture Notes in Computer Science, pages 140-148, Springer, 2023. [doi]

@inproceedings{TasnadiG23,
  title = {Heaviest and Densest Subgraph Computation for Binary Classification. A Case Study},
  author = {Zoltán Tasnádi and Noémi Gaskó},
  year = {2023},
  doi = {10.1007/978-3-031-53966-4_11},
  url = {https://doi.org/10.1007/978-3-031-53966-4_11},
  researchr = {https://researchr.org/publication/TasnadiG23},
  cites = {0},
  citedby = {0},
  pages = {140-148},
  booktitle = {Machine Learning, Optimization, and Data Science - 9th International Conference, LOD 2023, Grasmere, UK, September 22-26, 2023, Revised Selected Papers, Part II},
  editor = {Giuseppe Nicosia and Varun Ojha 0001 and Emanuele La Malfa and Gabriele La Malfa and Panos M. Pardalos and Renato Umeton},
  volume = {14506},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-53966-4},
}