Abstract
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is NP-hard if k is part of the input. We present a simple and efficient randomized algorithm for the simple case where the objective is to compute one new link pointing to a given node t producing the maximum increase in the PageRank value for t. The algorithm computes an approximation of the PageRank value for t in G(V, E ∪ {(v, t)}) for all nodes v with a running time corresponding to a small and constant number of PageRank computations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avrachenkov, K., Litvak, N.: The effect of new links on Google Pagerank. Stochastic Models 22(2), 319–331 (2006)
Bollen, J., Rodriguez, M.A., Van de Sompel, H.: Journal Status. Scientometrics 69(3), 669–687 (2006)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7), 107–117 (1998)
Chen, P., Xie, H., Maslov, S., Redner, S.: Finding scientific gems with Googles PageRank algorithm. Informetrics 1(1), 8–15 (2007)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand (1960)
Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)
Langville, A.N., Meyer, C.D.: Updating Markov Chains with an Eye on Google’s PageRank. SIAM J. Matrix Anal. Appl. 27(4), 968–987 (2006)
Meho, L.I., Yang, K.: Multi-faceted Approach to Citation-based Quality Assessment for Knowledge Management. In: World Library and Information Congress: 72nd IFLA General Conference and Council (2006)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olsen, M. (2008). The Computational Complexity of Link Building. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)