The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Updating Markov Chains with an Eye on Google's PageRank
SIAM Journal on Matrix Analysis and Applications
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
Maximizing pagerank with new backlinks
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Verifying nash equilibria in pagerank games on undirected web graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Reputation games for undirected graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study the problem of adding knew 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 kis part of the input. We present a simple and efficientrandomized algorithm for the simple case where the objective is to compute onenew link pointing to a given node tproducing the maximum increase in the PageRank value for t. The algorithm computes an approximation of the PageRank value for tin G(V, E茂戮驴 {(v, t)}) for all nodes vwith a running time corresponding to a smalland constantnumber of PageRank computations.