Sciweavers

Share
CIAC
2010
Springer

Maximizing PageRank with new Backlinks

9 years 10 months ago
Maximizing PageRank with new Backlinks
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.
Martin Olsen
Added 17 Jul 2010
Updated 17 Jul 2010
Type Conference
Year 2010
Where CIAC
Authors Martin Olsen
Comments (0)
books