Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining

Aritra Konar, Nicholas D. Sidiropoulos. Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining. In Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, editors, Thirty-Eigth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada. pages 8608-8616, AAAI Press, 2024. [doi]

@inproceedings{KonarS24,
  title = {Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining},
  author = {Aritra Konar and Nicholas D. Sidiropoulos},
  year = {2024},
  doi = {10.1609/aaai.v38i8.28705},
  url = {https://doi.org/10.1609/aaai.v38i8.28705},
  researchr = {https://researchr.org/publication/KonarS24},
  cites = {0},
  citedby = {0},
  pages = {8608-8616},
  booktitle = {Thirty-Eigth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada},
  editor = {Michael J. Wooldridge and Jennifer G. Dy and Sriraam Natarajan},
  publisher = {AAAI Press},
}