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 …

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 …

Clique is one of the most fundamental models for cohesive subgraph mining in network
analysis. Existing clique model mainly focuses on unsigned networks. In real world …

Computing the shortest path between two vertices is a fundamental problem in road
networks. Most of the existing works assume that the edges in the road networks have no …

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 …

-truss model is a typical cohesive subgraph model and has been received considerable
attention recently. However, the-truss model only considers the direct common neighbors of …

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 …

Computing the shortest path between two vertices is a fundamental problem in road
networks. Most of the existing works assume that the edges in the road networks have no …

Retrieving cohesive subgraphs in networks is a fundamental problem in social network
analysis and graph data management. These subgraphs can be used for marketing …

Clique is one of the most fundamental models for cohesive subgraph mining in network
analysis. Existing clique model mainly focuses on unsigned networks. However, in real …