Recently, the topic of community search (CS) has gained plenty of attention. Given a query
vertex, CS looks for a dense subgraph that contains it. Existing studies mainly focus on …

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 …

Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently.
An important structure k-bitruss is the maximal cohesive subgraph where each edge is …

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 …

Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs.
Maximal biclique enumeration (MBE) is challenging since the number of the maximal …

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 …

Recently there emerge many distributed algorithms that aim at solving subgraph matching at
scale. Existing algorithm-level comparisons failed to provide a systematic view of distributed …

Along with the rapid technological and commercial innovation on the e-commerce platforms,
there are an increasing number of frauds that bring great harm to these platforms. Many …

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 …