6 papers · 1 filter
New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
Xiangyun Ding, Yan Gu, Yihan Sun
Processing graphs with temporal information (the temporal graphs) has become increasingly important in the real world. In this paper, we study efficient solutions to temporal graph…
Parallel -Core Decomposition: Theory and Practice
Youzhe Liu, Xiaojun Dong, Yan Gu +1
This paper proposes efficient solutions for -core decomposition with high parallelism. The problem of -core decomposition is fundamental in graph analysis and has application…
Parallel Contraction Hierarchies Can Be Efficient and Scalable
Zijin Wan, Xiaojun Dong, Letong Wang +3
Contraction Hierarchies (CH) (Geisberger et al., 2008) is one of the most widely used algorithms for shortest-path queries on road networks. Compared to Dijkstra's algorithm, CH en…
Parallel d-tree with Batch Updates
Ziyang Men, Zheqi Shen, Yan Gu +1
The d-tree is one of the most widely used data structures to manage multi-dimensional data. Due to the ever-growing data volume, it is imperative to consider parallelism in d…
Parallel Cluster-BFS and Applications to Shortest Paths
Letong Wang, Guy Blelloch, Yan Gu +1
Breadth-first Search (BFS) is one of the most important graph processing subroutines, especially for computing the unweighted distance. Many applications may require running BFS fr…
Optimal (Randomized) Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu +1
In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range…