Efficient pagerank approximation via graph aggregation

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/www/BroderLMP04, title={Efficient pagerank approximation via graph aggregation}, pages={484-485}, year={2004}, crossref={DBLP:conf/www/2004at}, booktitle={WWW (Alternate Track Papers & Posters)}, ee={http://doi.acm.org/10.1145/1013367.1013537}, url={http://www.informatik.uni-trier.de/~ley/db/conf/www/www2004at.html#BroderLMP04}, author={Andrei Z. Broder and Ronny Lempel and Farzin Maghoul and Jan O. Pedersen} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Efficient_pagerank_approximation_via_graph_aggregation"
Personal tools