Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
From MaRDI portal
Publication:5474653
DOI10.1080/15427951.2005.10129104zbMath1095.68579MaRDI QIDQ5474653
B. Racz, Dániel Fogaras, Károly Csalogány, Tamás Sarlós
Publication date: 26 June 2006
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2005.10129104
68P10: Searching and sorting
68W05: Nonnumerical algorithms
68M10: Network design and communication in computer systems
Related Items
Communities, Random Walks, and Social Sybil Defense, Learning to Rank in Entity Relationship Graphs, Sublinear Algorithms for Local Graph-Centrality Estimation, Axiomatic characterization of PageRank, Personalized PageRank clustering: a graph clustering algorithm based on random walks, Optimizing node discovery on networks: problem definitions, fast algorithms, and observations, Red light green light method for solving large Markov chains, Towards a personalized Internet: a case for a full decentralization, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Traps and Pitfalls of Topic-Biased PageRank
Uses Software