作者: Jean-Charles Delvenne , Raphaël M. Jungers , Romain Hollanders
DOI:
关键词:
摘要: We consider the PageRank Optimization problem in which one seeks to maximize (or minimize) of a node graph through adding or deleting links from given subset. The can be modeled as Markov Decision Process and has recently received much attention. provide provably efficient methods solve on large graphs for number cases practical importance we show using perturbation analysis that close variation problem, same techniques have exponential worst case complexity.