In massive and rapid graph streams, a useful and important task is to summarize the
structure of graph streams in order to enable efficient and effective graph query processing …

Shortest path finding is the building block of various applications in road networks and the
index-based algorithms, especially hub labeling, can boost the query performance …

Shortest path computation is a fundamental operation in small-world networks and index-
based methods, especially 2-hop labeling, are commonly applied which have achieved high …

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 …

The most efficient known approach for shortest distance querying on road networks is via a
tree decomposition based 2-hop labeling index. A major challenge here is how to reduce …

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 …

Shortest path computation is a building block of various network applications. Since real-life
networks evolve as time passes, the Dynamic Shortest Path (DSP) problem has drawn lots …

Computing the shortest path for any two given vertices is an important problem in road
networks. Since real road networks are dynamically updated due to real-time traffic …

Hop-constrained st simple path (HC-st path) enumeration is a fundamental problem in graph
analysis and has received considerable attention recently. Straightforward distributed …

In the real world, road networks with weight and label on edges can be applied in several
application domains. The shortest path query with label restrictions has been receiving …