Efficient pagerank approximation via graph aggregation

Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Jan O. Pedersen. Efficient pagerank approximation via graph aggregation. In Stuart I. Feldman, Mike Uretsky, Marc Najork, Craig E. Wills, editors, Proceedings of the 13th international conference on World Wide Web - Alternate Track Papers & Posters, WWW 2004, New York, NY, USA, May 17-20, 2004. pages 484-485, ACM, 2004. [doi]

@inproceedings{BroderLMP04,
  title = {Efficient pagerank approximation via graph aggregation},
  author = {Andrei Z. Broder and Ronny Lempel and Farzin Maghoul and Jan O. Pedersen},
  year = {2004},
  doi = {10.1145/1013367.1013537},
  url = {http://doi.acm.org/10.1145/1013367.1013537},
  tags = {graph-rewriting, PageRank, rewriting},
  researchr = {https://researchr.org/publication/BroderLMP04},
  cites = {0},
  citedby = {0},
  pages = {484-485},
  booktitle = {Proceedings of the 13th international conference on World Wide Web - Alternate Track Papers & Posters, WWW 2004, New York, NY, USA, May 17-20, 2004},
  editor = {Stuart I. Feldman and Mike Uretsky and Marc Najork and Craig E. Wills},
  publisher = {ACM},
  isbn = {1-58113-912-8},
}