The Computational Complexity of Link Building

DOI10.1007/978-3-540-69733-6_13zbMath1148.68421OpenAlexW1515036960MaRDI QIDQ3511320

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

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

Related Items

Reputation games for undirected graphs

Cites Work

• Updating Markov Chains with an Eye on Google's PageRank
• The Effect of New Links on Google Pagerank
• Unnamed Item
• Unnamed Item
• Unnamed Item