Author:
Cohen Sara,Kimelfeld Benny,Koutrika Georgia
Publisher
Springer Berlin Heidelberg
Reference50 articles.
1. Adamic, L., Adar, E.: How to search a social network. In: VLDB, pp. 217–225 (1987)
2. Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte carlo methods in pagerank computation: When one iteration is sufficient. SIAM J. Numer. Anal. 45(2), 890–904 (2007)
3. Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized pagerank on mapreduce. In: SIGMOD Conference, pp. 973–984 (2011)
4. Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized pagerank. PVLDB 4(3), 173–184 (2010)
5. Balan, A.O., Traldi, L.: Preprocessing minpaths for sum of disjoint products. IEEE Trans. Reliability 52(3), 289–295 (2003)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献