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 …

Nowadays, in information systems such as web search engines and databases, diversity is
becoming increasingly essential and getting more and more attention for improving users' …

© 2020, VLDB Endowment. Maximum biclique search, which finds the biclique with the
maximum number of edges in a bipartite graph, is a fun-damental problem with a wide …

The classical K Shortest Paths (KSP) problem, which identifies the k shortest paths in a
directed graph, plays an important role in many application domains, such as providing …

Community search is important in graph analysis and can be used in many real applications.
In the literature, various community models have been proposed. However, most of them …

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 …

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 …

Computing the shortest path between two vertices is a fundamental problem in road
networks that is applied in a wide variety of applications. To support efficient shortest path …

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 …

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 …