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 …

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 …

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 …

In this paper, we study the problem of label-constrained reachability (LCR) query which is
fundamental in many applications with directed edge-label graphs. Although the classical …

The model of k-core and its decomposition have been applied in various areas, such as
social networks, the world wide web, and biology. A graph can be decomposed into an …

A key graph mining primitive is extracting dense structures from graphs, and this has led to
interesting notions such as k-cores which subsequently have been employed as building …

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 …

In this article, we propose the-core model, which is the first cohesive subgraph model on
uncertain bipartite graphs. To capture the uncertainty of relationships/edges,-degree is …

In applications such as biological, social, and transportation networks, interactions between
objects span multiple aspects. For accurately modeling such applications, multilayer …