PageRank optimization in polynomial time by stochastic shortest path reformulation

DOI10.1007/978-3-642-16108-7_11MaRDI QIDQ4930691zbMATH OpenOpenAlexFDO

Authors Balázs Csanád Csáji, Raphaël M. Jungers, Vincent D. Blondel

Publication date 1 October 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-16108-7_11

zbMATH Keywords

complexitydirected graphsMarkov decision processesPageRank

Mathematics Subject Classification ID

Random walks on graphs (05C81) Internet topics (68M11) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40)

Recommendations

• PageRank optimization by edge selection
• The Computational Complexity of Link Building
• Maximizing PageRank with new backlinks
• A constant-factor approximation algorithm for the link building problem
• Maximizing PageRank via outlinks

Cited in

(7)

• Perron vector optimization applied to search engines
• PageRank optimization by edge selection
• Reputation games for undirected graphs
• The Computational Complexity of Link Building
• Hardness of bounding influence via graph modification
• A note on valid inequalities for PageRank optimization with edge selection constraints
• A pseudo-gradient approach for model-free Markov chain optimization

This page was built for publication: PageRank optimization in polynomial time by stochastic shortest path reformulation

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