Related references
Note: Only part of the references are listed.sGrapp: Butterfly Approximation in Streaming Graphs
Aida Sheshbolouki et al.
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2022)
Trust: Triangle Counting Reloaded on GPUs
Santosh Pandey et al.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2021)
Triangle counting on GPU using fine-grained task distribution
Lin Hu et al.
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW 2019) (2019)
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
Pinghui Wang et al.
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019) (2019)
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks
Kai Wang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2019)
Fast Rectangle Counting on Massive Networks
Rong Zhu et al.
2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM) (2018)
Butterfly Counting in Bipartite Networks
Seyed-Vahid Sanei-Mehri et al.
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING (2018)
Ranking weighted clustering coefficient in large dynamic graphs
Xuefei Li et al.
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS (2017)
PATRIC: A Parallel Algorithm for Counting Triangles in Massive Networks
Shaikh Arifuzzaman et al.
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13) (2013)
Counting triangles in real-world networks using projections
Charalampos E. Tsourakakis
KNOWLEDGE AND INFORMATION SYSTEMS (2011)
Main-memory triangle computations for very large (sparse (power-law)) graphs
Matthieu Latapy
THEORETICAL COMPUTER SCIENCE (2008)