PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Cite
Text
Csáji et al. "PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation." International Conference on Algorithmic Learning Theory, 2010. doi:10.1007/978-3-642-16108-7_11Markdown
[Csáji et al. "PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation." International Conference on Algorithmic Learning Theory, 2010.](https://mlanthology.org/alt/2010/csaji2010alt-pagerank/) doi:10.1007/978-3-642-16108-7_11BibTeX
@inproceedings{csaji2010alt-pagerank,
title = {{PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation}},
author = {Csáji, Balázs Csanád and Jungers, Raphaël M. and Blondel, Vincent D.},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2010},
pages = {89-103},
doi = {10.1007/978-3-642-16108-7_11},
url = {https://mlanthology.org/alt/2010/csaji2010alt-pagerank/}
}