Persistent graph stream summarization for real-time graph analytics
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 …
structure of graph streams in order to enable efficient and effective graph query processing …
Dynamic hub labeling for road networks
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 …
index-based algorithms, especially hub labeling, can boost the query performance …
Distributed hop-constrained st simple path enumeration at billion scale
Hop-constrained st simple path (HC-st path) enumeration is a fundamental problem in graph
analysis and has received considerable attention recently. Straightforward distributed …
analysis and has received considerable attention recently. Straightforward distributed …
Efficient 2-hop labeling maintenance in dynamic small-world networks
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 …
based methods, especially 2-hop labeling, are commonly applied which have achieved high …
Efficient maximal balanced clique enumeration in signed networks
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 …
analysis. Existing clique model mainly focuses on unsigned networks. In real world …
An experimental evaluation and guideline for path finding in weighted dynamic network
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 …
networks evolve as time passes, the Dynamic Shortest Path (DSP) problem has drawn lots …
Towards efficient shortest path counting on billion-scale graphs
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 …
graph, which can be used in the applications such as social network search and POI (Point …
Automatic road extraction with multi-source data revisited: completeness, smoothness and discrimination
Extracting roads from multi-source data, such as aerial images and vehicle trajectories, is an
important way to maintain road networks in the filed of urban computing. In this paper, we …
important way to maintain road networks in the filed of urban computing. In this paper, we …
Relative subboundedness of contraction hierarchy and hierarchical 2-hop index in dynamic road networks
Y Zhang, JX Yu - Proceedings of the 2022 International Conference on …, 2022 - dl.acm.org
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 …
networks. Since real road networks are dynamically updated due to real-time traffic …
Comparing alternative route planning techniques: A comparative user study on melbourne, dhaka and copenhagen road networks
Many modern navigation systems and map-based services do not only provide the fastest
route from a source location to a target location but also provide a few alternative routes to …
route from a source location to a target location but also provide a few alternative routes to …