DeepAI AI Chat
Log In Sign Up

A Novel Parallel Triangle Counting Algorithm with Reduced Communication

10/01/2022
by   David A. Bader, et al.
New Jersey Institute of Technology
0

Counting and finding triangles in graphs is often used in real-world analytics for characterizing the cohesiveness and identifying communities in graphs. In this paper, we present novel sequential and parallel triangle counting algorithms based on identifying horizontal-edges in a breadth-first search (BFS) traversal of the graph. The BFS allows our algorithm to drastically reduce the number of edges examined for set intersections. Our new approach is the first communication-optimal parallel algorithm that asymptotically reduces the communication on massive graphs such as from real social networks and synthetic graphs from the Graph500 Benchmark. In our estimate from massive-scale Graph500 graphs, our new algorithms reduces the communication by 21.8x on a scale 36 and by 180x on a scale 42. Because communication is known to be the dominant cost of parallel triangle counting, our new parallel algorithm, to our knowledge, is now the fastest method for counting triangles in large graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/22/2019

A 2D Parallel Triangle Counting Algorithm for Distributed-Memory Architectures

Triangle counting is a fundamental graph analytic operation that is used...
07/26/2021

TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata

Understanding the higher-order interactions within network data is a key...
02/22/2023

Engineering a Distributed-Memory Triangle Counting Algorithm

Counting triangles in a graph and incident to each vertex is a fundament...
03/10/2020

Optimizations to the Parallel Breath First Search on Distributed Memory

Graphs and their traversal is becoming significant as it is applicable t...
10/13/2021

Communication-Efficient Triangle Counting under Local Differential Privacy

Triangle counting in networks under LDP (Local Differential Privacy) is ...
11/22/2018

REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel

Recently, considerable efforts have been devoted to approximately comput...
02/03/2022

A Method for Counting, Tracking and Monitoring of Visitors with RFID sensors

This publication presents a method responsible for counting tracking and...