Author:
Bruck Péter,Réthy István,Szente Judit,Tobochnik Jan,Érdi Péter
Publisher
Springer Science and Business Media LLC
Subject
Library and Information Sciences,Computer Science Applications,General Social Sciences
Reference31 articles.
1. Avrachenkov, K., Litvak, N., & Pham, K. S. (2008). A singular perturbation approach for choosing the PageRank damping factor. Internet Mathematics, 5(1–2), 47–70.
2. Boldi, P., Santini, M., & Vigna S. (2005). Pagerank as a function of the damping factor. In Proceedings of the 14th international conference on World Wide Web (pp. 557–566). Association for Computing Machinery, New York.
3. Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30, 107–117.
4. Chen, P., Xie, H., Maslov, S., & Redner, S. (2007). Finding scientific gems with Google. Journal of Informetrics, 1, 8–15.
5. Csárdi, G., Strandburg, K. J., Tobochnik, J., & Érdi, P. (2009). The inverse problem of evolving networks—With application to social nets. In B. Bollobás, R. Kozma, & D. Miklós (Eds.), Handbook of large-scale random networks (pp. 409–443). New York: Springer.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献