Finding the optimal path over multi-cost graphs
暂无分享,去创建一个
[1] Hong Cheng,et al. Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme , 2012, 2012 IEEE 28th International Conference on Data Engineering.
[2] George Karypis,et al. Multilevel algorithms for partitioning power-law graphs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[3] Kyriakos Mouratidis,et al. Preference queries in large multi-cost transportation networks , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[4] Jian Pei,et al. Efficiently indexing shortest paths by exploiting symmetry in graphs , 2009, EDBT '09.
[5] James Cheng,et al. Efficient processing of distance queries in large graphs: a vertex cover approach , 2012, SIGMOD Conference.
[6] Slobodan P. Simonovic,et al. An Evolution Program for Non-Linear Transportation Problems , 2001, J. Heuristics.
[7] Luis Gravano,et al. Evaluating Top-k Selection Queries , 1999, VLDB.