The Computational Complexity of Link Building

DOI10.1007/978-3-540-69733-6_13MaRDI QIDQ3511320zbMATH OpenOpenAlexFDO

Authors Martin Olsen

Publication date 10 July 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_13

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Maximizing PageRank with new backlinks
• A constant-factor approximation algorithm for the link building problem
• On the approximability of the link building problem
• PageRank optimization by edge selection
• PageRank optimization in polynomial time by stochastic shortest path reformulation

Cites work

• Google's PageRank and beyond. The science of search engine rankings
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The Effect of New Links on Google Pagerank
• Updating Markov Chains with an Eye on Google's PageRank

Cited in

(8)

• On the complexity of the Monte Carlo method for incremental PageRank
• PageRank optimization by edge selection
• Reputation games for undirected graphs
• A constant-factor approximation algorithm for the link building problem
• Maximizing PageRank with new backlinks
• On the approximability of the link building problem
• PageRank optimization in polynomial time by stochastic shortest path reformulation
• Maximizing PageRank via outlinks

This page was built for publication: The Computational Complexity of Link Building

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