DeMEtRIS: Counting (near)-Cliques by Crawling-Reference-Cited by-同舟云学术

DeMEtRIS: Counting (near)-Cliques by Crawling

Published:2023-02-27 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining
language:
Short-container-title:

Author:

Bera Suman K.¹^ORCID,Choudhari Jayesh²^ORCID,Haddadan Shahrzad³^ORCID,Ahmadian Sara⁴^ORCID

Affiliation:

1. Katana Graph, San Jose, CA, USA

2. Cube Global Ltd., London, United Kingdom

3. Rutgers Business School and Brown Data Science Initiative, New Brunswick, NJ, USA

4. Google Research, Mountain View, CA, USA

Funder

NSF-TRIPODS

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3539597.3570438

Reference59 articles.

1. [n.d.]. Facebook User Public API. https://developers.facebook.com/docs/graph-api/reference/user/. Accessed: 2022-01--31. [n.d.]. Facebook User Public API. https://developers.facebook.com/docs/graph-api/reference/user/. Accessed: 2022-01--31.

2. [n.d.]. Twitter Public API. https://developer.twitter.com/en/docs/twitter-api/v1/accounts-and-users/follow-search-get-users/overview. Accessed: 2022-01--31. [n.d.]. Twitter Public API. https://developer.twitter.com/en/docs/twitter-api/v1/accounts-and-users/follow-search-get-users/overview. Accessed: 2022-01--31.

3. Balázs Adamcsek , Gergely Palla , Illés J Farkas , Imre Derényi , and Tamás Vicsek . 2006. CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics ( 2006 ). Balázs Adamcsek, Gergely Palla, Illés J Farkas, Imre Derényi, and Tamás Vicsek. 2006. CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics (2006).

4. Matteo Agostini Marco Bressan and Shahrzad Haddadan. 2019. Mixing time bounds for graphlet random walks. Inform. Process. Lett. (2019). Matteo Agostini Marco Bressan and Shahrzad Haddadan. 2019. Mixing time bounds for graphlet random walks. Inform. Process. Lett. (2019).

5. Maryam Aliakbarpour , Amartya Shankha Biswas , Themis Gouleakis, John Peebles, Ronitt Rubinfeld, and Anak Yodpinyanee. 2018 . Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica ( 2018). Maryam Aliakbarpour, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, and Anak Yodpinyanee. 2018. Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica (2018).