Computing subgraph frequencies is a fundamental task that lies at the core of several
network analysis methodologies, such as network motifs and graphlet-based metrics, which …

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 …

Counting the frequency of small subgraphs is a fundamental technique in network analysis
across various domains, most notably in bioinformatics and social networks. The special …

Malicious webshells currently present tremendous threats to cloud security. Most relevant
studies and open webshell datasets consider malicious webshell defense as a binary …

Counting the frequency of small subgraphs is a fundamental technique in network analysis
across various domains, most notably in bioinformatics and social networks. The special …

Motivation: With increasing availability of temporal real-world networks, how to efficiently
study these data? One can model a temporal network as a single aggregate static network …

Subgraph counting is a fundamental graph analysis task which has been widely used in
many applications. As the problem of subgraph counting is NP-complete and hence …

Clique counts reveal important properties about the structure of massive graphs, especially
social networks. The simple setting of just 3-cliques (triangles) has received much attention …

Motifs are the fundamental components of complex systems. The topological structure of
networks representing complex systems and the frequency and distribution of motifs in these …

Predicting the link state of a network at a future time given a collection of link states at earlier
time is an important task with many real-life applications. In existing literature this task is …