Attributed graphs with both topological information and node information have prevalent
applications in the real world, including recommendation systems, biological networks …

Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality,
relationships between two types of entities often occur at some specific timestamps, which …

Many real-world binary relations can be modelled as bipartite graphs, which can be
inherently temporal and each edge is associated with a timestamp. The (α, β)-core, a …

Counting (p, q)-bicliques in bipartite graphs poses a foundational challenge with broad
applications, from densest sub-graph discovery in algorithmic research to personalized …

Finding dense subnetworks, with density based on edges or more complex structures, such
as subgraphs or k-cliques, is a fundamental algorithmic problem with many applications …

Bipartite graph models the relationship between two different sets of entities. Such graph
data become more dynamic and are organized as stream with duplicate edges in real-word …

For a temporal graph like transaction network, finding a densely connected subgraph that
contains a vertex like a suspicious account during a period is valuable. Thus, we study the …

In many real-world applications (eg, email networks, social networks, and phone call
networks), the relationships between entities can be modeled as a temporal graph, in which …

Bipartite graphs have numerous real-world applications, with the butterfly motif serving as a
key higher-order structure that models cohesion within these graphs. Analyzing butterflies is …

Network motifs provide a deep insight into the network functional abilities, and have proven
useful in various practical applications. Existing studies reveal that different definitions of …