With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

The problem of computing (α, β)-core in a bipartite graph for given α and β is a fundamental
problem in bipartite graph analysis and can be used in many applications such as online …

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 …

The problem of computing (α, β α, β)-core in a bipartite graph for given α α and β β is a
fundamental problem in bipartite graph analysis and can be used in many applications such …

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 …

Due to the ubiquity of graphs, graph analytics has attracted much attention from both
research and industry communities. The notion of k-truss is widely used in graph analytics …

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 …

As a fundamental graph problem, community search is applied in various areas, eg, social
networks, the world wide web, and biology. A common requirement from real applications is …

We propose a novel cohesive subgraph model called τ-strengthened (α, β)-core (denoted as
(α, β) τ-core), which is the first to consider both tie strength and vertex engagement on …

In this paper, we propose and study a novel cohesive subgraph model, named (k, p)-core,
which is a maximal subgraph where each vertex has at least k neighbours and at least p …