PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation

Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts

• Type: Journal
• Year: 2010
• Where: ALT
• Authors: Balázs Csanád Csáji, Raphaël M. Jungers, Vincent D. Blondel
• Keywords: ALT 2010, Infinite Random Walk, Machine Learning, Node, PageRank