Abstract
For a given node t in a directed graph G(V G ,E G ) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – producing the maximum increase in the PageRank value of t. This problem is known as Link Building in the www context. We present a theorem describing how the topology of the graph comes in to play when evaluating potential new backlinks. Based on the theorem we show that no FPTAS exists for Link Building under the assumption NP≠P and we also show that Link Building is W[1]-hard.
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.
Similar content being viewed by others
References
Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. Computer Networks and ISDN Systems 30, 107–117 (1998)
Olsen, P.R.: A Future in Directing Online Traffic. The New York Times (2009), http://www.nytimes.com/2009/01/11/jobs/11starts.html
Blankson, S.: SEO. In: How to Optimize your Web Site for Internet Search Engines, Blankson Enterprises Ltd., London (2008)
Kent, P.: Search Engine Optimization For Dummies. Wiley, Indianapolis (2006)
Ledford, J.L.: Search Engine Optimization Bible. Wiley, Indianapolis (2008)
Smith, J.: Get into Bed with Google. The Infinite Ideas Company Limited, Oxford (2008)
SEOmoz: Search engine ranking factors 2009 (2009), http://www.seomoz.org/article/search-ranking-factors
Avrachenkov, K., Litvak, N.: The Effect of new Links on Google Pagerank. Stochastic Models 22, 319–331 (2006)
de Kerchove, C., Ninove, L., van Dooren, P.: Maximizing PageRank via outlinks. Linear Algebra and its Applications 429, 1254–1276 (2008)
Olsen, M.: The Computational Complexity of Link Building. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 119–129. Springer, Heidelberg (2008)
Cheetham, J., Dehne, F., Rau-chaplin, A., Stege, U., Taillon, P.J.: Solving Large FPT Problems on Coarse Grained Parallel Machines. Journal of Computer and System Sciences 67, 691–706 (2002)
Chen, J., Meng, J.: On Parameterized Intractability: Hardness and Completeness. Comput. J. 51, 39–59 (2008)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)
Harville, D.A.: Matrix Algebra From a Statistician’s Perspective. Springer, Heidelberg (1997)
Elias, I.: Settling the Intractability of Multiple Alignment. Technical Report TRITA-NA-0316, Nada, KTH (2003)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Cai, L.: Parameterized Complexity of Cardinality Constrained Optimization Problems. Comput. J. 51, 102–121 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olsen, M. (2010). Maximizing PageRank with New Backlinks. In: Calamoneri, T., Diaz, J. (eds) Algorithms and Complexity. CIAC 2010. Lecture Notes in Computer Science, vol 6078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13073-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-13073-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13072-4
Online ISBN: 978-3-642-13073-1
eBook Packages: Computer ScienceComputer Science (R0)