The k-truss is a type of cohesive subgraphs proposed recently for the study of networks.
While the problem of computing most cohesive subgraphs is NP-hard, there exists a …

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 …

Bipartite networks are of great importance in many realworld applications. In bipartite
networks, butterfly (ie, a complete 2× 2 biclique) is the smallest non-trivial cohesive structure …

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 …

Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has
numerous important applications. Though extensively studied, most existing algorithms …

This paper studies I/O-efficient algorithms for settling the classic triangle listing problem,
whose solution is a basic operator in dealing with many other graph problems. Specifically …

Subgraph matching is a fundamental task in many applications which identifies all the
embeddings of a query pattern in an input graph. Compilation-based subgraph matching …

Exploring statistics of locally connected subgraph patterns (also known as network motifs)
has helped researchers better understand the structure and function of biological and Online …

Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …

Reachability querying is a basic graph operation with numerous important applications in
databases, network analysis, computational biology, software engineering, etc. Although …