Maximizing PageRank with New Backlinks

DOI10.1007/978-3-642-13073-1_5zbMath1284.68062OpenAlexW1591391684MaRDI QIDQ3562990

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

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

Related Items (2)

Reputation games for undirected graphs ⋮ On the approximability of the link building problem

This page was built for publication: Maximizing PageRank with New Backlinks