Efficient PageRank approximation via graph aggregation.
Andrei Z. Broder|Ronny Lempel|Farzin Maghoul|Jan O. Pedersen
| Anthology ID: | DBLP:journals/ir/BroderLMP06 |
|---|---|
| Year: | 2006 |
| Venue: | Discover Computing |
| Pages: | 123-138 |
| URL: | https://doi.org/10.1007/S10791-006-7146-1 |
| DOI: | https://doi.org/10.1007/S10791-006-7146-1 |
| DBLP: | journals/ir/BroderLMP06 |
| BibTeX: |
@article{broder-2006-efficient,
author = {Andrei Z. Broder and
Ronny Lempel and
Farzin Maghoul and
Jan O. Pedersen},
title = {{Efficient PageRank approximation via graph aggregation}},
journal = {Discover Computing},
volume = {9},
number = {2},
pages = {123--138},
year = {2006},
url = {https://doi.org/10.1007/S10791-006-7146-1},
doi = {https://doi.org/10.1007/S10791-006-7146-1}
}