With the rapid development of science and technology, the world is becoming increasingly
connected. The following dire need for understanding both the relationships amongst …

The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

Bipartite graphs are widely used to model relation-ships between two types of entities.
Community search retrieves densely connected subgraphs containing a query vertex, which …

In this paper, we investigate the problem of (k, r)-core which intends to find cohesive
subgraphs on social networks considering both user engagement and similarity …

The studies of k-truss based community search demonstrated that it can find high-quality
personalized com-munities with good properties such as high connectivity and bounded …

With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …

Aging is associated with gradual changes in cognition, yet some individuals exhibit
protection against age-related cognitive decline. The topological characteristics of brain …

In recent years, cohesive subgraph mining in bipartite graphs becomes a popular research
topic. An important cohesive subgraph model k-bitruss is the maximal cohesive subgraph …

In this paper, we study the k-clique densest subgraph problem, which detects the subgraph
that maximizes the ratio between the number of k-cliques and the number of vertices in it …

A popular model to measure the stability of a network is k-core-the maximal induced
subgraph in which every vertex has at least k neighbors. Many studies maximize the number …