Counting and enumeration of local topological structures, such as triangles, is an important
task for analyzing large real‐life networks. For instance, triangle count in a network is used …

Large networks are becoming a widely used abstraction for studying complex systems in a
broad set of disciplines, ranging from social-network analysis to molecular biology and …

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 …

We study the problem of finding and monitoring fixed-size subgraphs in a continually
changing large-scale graph. We present the first approach that (i) performs worst-case …

Triangle counting and enumeration are important kernels that are used to characterize
graphs. They are also used to compute important statistics such as clustering coefficients …

We consider the problem of estimating the number of triangles in a graph. This problem has
been extensively studied in both theory and practice, but all existing algorithms read the …

Triangle counting in networks under LDP (Local Differential Privacy) is a fundamental task
for analyzing connection patterns or calculating a clustering coefficient while strongly …

Exact triangle counting algorithm enumerates the triangles in a graph by identifying the
common neighbors of two vertices of each edge. In this work, we present TriCore, a scalable …

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 …

We present space-efficient data stream algorithms for approximating the number of triangles
in a graph up to a factor 1+ ε. While it can be shown that determining whether a graph is …