There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …

Triangle counting and enumeration has emerged as a basic tool in large-scale network
analysis, fueling the development of algorithms that scale to massive graphs. Most of the …

Fine-grained reductions have established equivalences between many core problems with
Õ (n 3)-time algorithms on n-node weighted graphs, such as Shortest Cycle, All-Pairs …

How can we estimate local triangle counts accurately in a graph stream without storing the
whole graph? The local triangle counting which counts triangles for each node in a graph is …

Subgraph matching finds a set I of all occurrences of a pattern graph in a target graph. It has
a wide range of applications while suffers an expensive computation. This efficiency issue …

We describe an optimal randomized MapReduce algorithm for the problem of triangle
enumeration that requires O (E3/2/(M√ m) rounds, where m denotes the expected memory …

We present new algorithms for listing triangles in dense and sparse graphs. The running
time of our algorithm for dense graphs is ̃\mathcalO(n^ω+n^3(ω-1)/(5-ω)t^2(3-ω)/(5-ω)), and …

How can we enumerate triangles from an enormous graph with billions of vertices and
edges? Triangle enumeration is an important task for graph data analysis with many …

In this paper, we study the communication complexity for the problem of computing a
conjunctive query on a large database in a parallel setting with p servers. In contrast to …

Counting triangles in a large graph is important for detecting network anomalies such as
spam web pages and suspicious accounts (eg, fraudsters and advertisers) on online social …