PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation

DOI10.1007/978-3-642-16108-7_11zbMath1306.68126OpenAlexW1773860787MaRDI QIDQ4930691

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

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

complexityMarkov decision processesdirected graphsPageRank

Mathematics Subject Classification ID

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

Related Items (4)

Reputation games for undirected graphs ⋮ Hardness of bounding influence via graph modification ⋮ Perron vector optimization applied to search engines ⋮ PageRank optimization by edge selection

This page was built for publication: PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation