论文信息 - Exact Distance Query in Large Graphs through Fast Graph Simplification - 字舞流文

Exact Distance Query in Large Graphs through Fast Graph Simplification

Jun Liu | Yicheng Pan | Qifu Hu

[1] Raymond Chi-Wing Wong,et al. Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks , 2014, Proc. VLDB Endow..

[2] Mikkel Thorup,et al. Approximate distance oracles , 2005, J. ACM.

[3] Hong Cheng,et al. The exact distance to destination in undirected world , 2012, The VLDB Journal.

[4] Edith Cohen,et al. Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[5] Dietmar Schomburg,et al. Observing local and global properties of metabolic pathways: "load points" and "choke points" in the metabolic networks , 2006, Bioinform..

[6] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[7] Haixun Wang,et al. Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks , 2013, ArXiv.

[8] Shuigeng Zhou,et al. Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation , 2012, Proc. VLDB Endow..

[9] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[10] Stefan Funke,et al. On k-Path Covers and their Applications , 2014, Proc. VLDB Endow..

[11] Lei Ying,et al. Information source detection in the SIR model: A sample path based approach , 2012, 2013 Information Theory and Applications Workshop (ITA).