1. Fast Top-k Simple Shortest Paths Discovery in Graphs Database Research Group Department of Computer Science Peking University Jun Gao, Huida Qiu, Xiao Jiang, Dongqing Yang, Tenjiao Wang
2.
3.
4.
5.
6.
7.
8.
9.
10.
11. Graph Pre-processing Precompute the shortest path tree rooted at t Make side cost of each edge Assign (pre, post, parent) encoding on each node to accelarate the loop detection