Efficient Processing of Probabilistic Single and Batch Reachability Queries in Large and Evolving Spatiotemporal Contact Networks
暂无分享,去创建一个
[1] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[2] Farnoush Banaei Kashani,et al. Probabilistic reachability query in evolving spatiotemporal contact networks of moving objects , 2018, SIGSPATIAL/GIS.
[3] Farnoush Banaei Kashani,et al. Reach Me If You Can: Reachability Query in Uncertain Contact Networks , 2018, GeoRich@SIGMOD.
[4] Mohammed J. Zaki,et al. GRAIL , 2010, Proc. VLDB Endow..
[5] Shashi Shekhar,et al. Encyclopedia of GIS , 2007, Encyclopedia of GIS.
[6] Guoren Wang,et al. DistR: A Distributed Method for the Reachability Query over Large Uncertain Graphs , 2016, IEEE Transactions on Parallel and Distributed Systems.
[7] Xuemin Lin,et al. BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries , 2011, DASFAA.
[8] Alexander Borgida,et al. Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.
[9] Philipp Sommer,et al. Generic mobility simulation framework (GMSF) , 2008, MobilityModels '08.
[10] Farnoush Banaei Kashani,et al. Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets , 2012, Proc. VLDB Endow..
[11] Hans L. Bodlaender,et al. Parallel Algorithms for Series Parallel Graphs , 1996, ESA.
[12] Haixun Wang,et al. Distance-Constraint Reachability Computation in Uncertain Graphs , 2011, Proc. VLDB Endow..