Maximizing pagerank with new backlinks

  • Authors:

  • Martin Olsen

  • Affiliations:

  • Center for Innovation and Business Development, Institute of Business and Technology, Aarhus University, Herning, Denmark

  • Venue:
  • CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

For a given node t in a directed graph G(VG,EG) 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.