Maximizing PageRank with new backlinks

DOI10.1007/978-3-642-13073-1_5MaRDI QIDQ3562990zbMATH OpenOpenAlexFDO

Authors Martin Olsen

Publication date 28 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13073-1_5

Mathematics Subject Classification ID

Internet topics (68M11) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The Computational Complexity of Link Building
• A constant-factor approximation algorithm for the link building problem
• On the approximability of the link building problem
• PageRank optimization by edge selection
• The Effect of New Links on Google Pagerank

Cited in

(9)

• PageRank optimization by edge selection
• Reputation games for undirected graphs
• A constant-factor approximation algorithm for the link building problem
• The Computational Complexity of Link Building
• On the approximability of the link building problem
• An analysis of optimal link bombs
• PageRank optimization in polynomial time by stochastic shortest path reformulation
• Fully personalized PageRank and algebraic methods to distribute a random walker
• Maximizing PageRank via outlinks

This page was built for publication: Maximizing PageRank with new backlinks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562990)