Shortest path counting computes the number of shortest paths between two vertices on a
graph, which can be used in the applications such as social network search and POI (Point …

In this paper, we study two different problems that investigate relations between given
vertices and. The first problem is to generate the-hop-constrained-path graph, ie, the …

(α, β)-core is an important cohesive subgraph model for bipartite graphs. Given a bipartite
graph G, the problem of (α, β)-core decomposition is to compute non-empty (α, β)-cores for …

Community search is a problem that seeks cohesive and connected subgraphs in a graph
that satisfy certain topology constraints, eg, degree constraints. The majority of existing …

Structural clustering (SCAN) is one of the most popular graph clustering paradigms.
However, SCAN assumes that the input graph is undirected and can not cluster the directed …

When graph database users explore unfamiliar graphs, potentially with heterogeneous
structure, users may need to find how two or more groups of nodes are connected in a …

Bipartite graphs are widely used to capture the relationships between two types of entities. In
bipartite graph analysis, finding the maximum balanced biclique (MBB) is an important …

Community search over bipartite graphs has attracted significant interest recently. In many
applications such as the user–item bipartite graph in e-commerce and customer–movie …

Distance labeling approaches are widely adopted to speed up the shortest-distance query
performance. Due to the explosive growth of data graphs, a single machine can hardly …

Biclique percolation community (BPC) search is a fundamental problem in bipartite graph
analysis and have many applications. Existing online approach has to enumerate all the …