Butterfly Counting in Bipartite Networks-Reference-Cited by-同舟云学术

Butterfly Counting in Bipartite Networks

Published:2018-07-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
language:
Short-container-title:

Author:

Sanei-Mehri Seyed-Vahid¹,Sariyuce Ahmet Erdem²,Tirthapura Srikanta¹

Affiliation:

1. Iowa State University, Ames, IA, USA

2. University at Buffalo, Buffalo, NY, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference32 articles.

1. 2017. GNIP. (https://gnip.com/about/ ). 2017. GNIP. (https://gnip.com/about/ ).

2. 2017. The Graph API for the Facebook Social Graph. (https://developers.facebook.com/docs/graph-api). 2017. The Graph API for the Facebook Social Graph. (https://developers.facebook.com/docs/graph-api).

3. Graphlet decomposition: framework, algorithms, and applications

4. Measuring and modeling bipartite graphs with community structure

5. Finding and counting given length cycles

Cited by 68 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks;Proceedings of the VLDB Endowment;2024-07

2. GPU-based butterfly counting;The VLDB Journal;2024-06-27

3. Parallelization of butterfly counting on hierarchical memory;The VLDB Journal;2024-06-07

4. Toward Accurate Butterfly Counting with Edge Privacy Preserving in Bipartite Networks;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

5. Accelerating Biclique Counting on GPU;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13