Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets.
Sabyasachi Basu|Daniel Paul-Pena|Kun Qian|C. Seshadhri|Edward W. Huang|Karthik Subbian
| Anthology ID: | DBLP:conf/cikm/BasuP00HS24 |
|---|---|
| Volume: | Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024 |
| Year: | 2024 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 109-119 |
| URL: | https://doi.org/10.1145/3627673.3679578 |
| DOI: | https://doi.org/10.1145/3627673.3679578 |
| DBLP: | conf/cikm/BasuP00HS24 |
| BibTeX: |
@inproceedings{basu-2024-covering,
author = {Sabyasachi Basu and
Daniel Paul-Pena and
Kun Qian and
C. Seshadhri and
Edward W. Huang and
Karthik Subbian},
editor = {Edoardo Serra and
Francesca Spezzano},
title = {{Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets}},
booktitle = {{Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, CIKM 2024, Boise, ID, USA, October 21-25, 2024}},
pages = {109--119},
publisher = {ACM},
year = {2024},
url = {https://doi.org/10.1145/3627673.3679578},
doi = {https://doi.org/10.1145/3627673.3679578}
}