4.7 Article

Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Information Systems

sGrapp: Butterfly Approximation in Streaming Graphs

Aida Sheshbolouki et al.

Summary: This article studies the fundamental problem of butterfly counting in bipartite streaming graphs, introducing an approximate adaptive window-based algorithm, sGrapp, and its optimized version sGrapp-x. Experimental studies show superior performance in terms of both accuracy and efficiency.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2022)

Article Computer Science, Theory & Methods

Trust: Triangle Counting Reloaded on GPUs

Santosh Pandey et al.

Summary: Traditional wisdom suggests that hashing is not suitable for triangle counting, edge-centric counting is better, and communication-free, workload-balanced graph partitioning is a challenge. However, research finds that hashing can help scalable triangle counting on GPUs, vertex-centric design reduces costs and improves scalability, ultimately achieving a high throughput rate for triangle counting.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2021)

Proceedings Paper Computer Science, Information Systems

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)

Proceedings Paper Computer Science, Information Systems

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)

Article Computer Science, Information Systems

Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks

Kai Wang et al.

PROCEEDINGS OF THE VLDB ENDOWMENT (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Fast Rectangle Counting on Massive Networks

Rong Zhu et al.

2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM) (2018)

Proceedings Paper Computer Science, Artificial Intelligence

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)

Article Computer Science, Information Systems

Ranking weighted clustering coefficient in large dynamic graphs

Xuefei Li et al.

WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS (2017)

Proceedings Paper Computer Science, Artificial Intelligence

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)

Article Computer Science, Artificial Intelligence

Counting triangles in real-world networks using projections

Charalampos E. Tsourakakis

KNOWLEDGE AND INFORMATION SYSTEMS (2011)

Article Anthropology

Clustering in weighted networks

Tore Opsahl et al.

SOCIAL NETWORKS (2009)

Article Computer Science, Theory & Methods

Main-memory triangle computations for very large (sparse (power-law)) graphs

Matthieu Latapy

THEORETICAL COMPUTER SCIENCE (2008)