All our codes are sequential codes (with in-memory graph representation) and for research purposes only. If you would like to use our current codes and datasets, please always look for the latest versions. We shall be happy to get feedbacks from you and help you if there is any problem.
SIGMOD'11 Repeatability and Workability Result: Repeatable & Workable .
Arijit Khan , Nan Li, Xifeng Yan, Ziyu Guan, Supriyo Chakraborty, and Shu Tao, "Neighborhood Based Fast Graph Search in Large Networks", [paper], in Proc. of International Conference on Management of Data 2011 (SIGMOD 2011), pp. 901-912. .
Arijit Khan , Francesco Bonchi, Aris Gionis, and Francesco Gullo, "Fast Reliability Search in Uncertain Graphs", [paper], in Proc. of International Conferences on Extending Database Technology 2014 (EDBT 2014) .