A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem.
| Anthology ID: | DBLP:conf/www/JainS17 |
|---|---|
| Volume: | Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017 |
| Year: | 2017 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 441-449 |
| URL: | https://doi.org/10.1145/3038912.3052636 |
| DOI: | https://doi.org/10.1145/3038912.3052636 |
| DBLP: | conf/www/JainS17 |
| BibTeX: |
@inproceedings{jain-2017-fast,
author = {Shweta Jain and
C. Seshadhri},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
title = {{A Fast and Provable Method for Estimating Clique Counts Using Tur\'{a}n's Theorem}},
booktitle = {{Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017}},
pages = {441--449},
publisher = {ACM},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052636},
doi = {https://doi.org/10.1145/3038912.3052636}
}