Distributed PageRank computation with improved round complexities
From MaRDI portal
Publication:6195176
DOI10.1016/j.ins.2022.05.108OpenAlexW4281639610MaRDI QIDQ6195176
Xiaowei Wu, Ben Kao, Siqiang Luo
Publication date: 13 March 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2022.05.108
Cites Work
- Unnamed Item
- Fast distributed PageRank computation
- Lessons from the congested clique applied to MapReduce
- An efficient elimination strategy for solving PageRank problems
- The diameter of a scale-free random graph
- A Hessenberg-type algorithm for computing PageRank problems
- A variant of the Power-Arnoldi algorithm for computing PageRank
- Toward Optimal Bounds in the Congested Clique
- On the power of the congested clique model
- Estimating PageRank on graph streams
- Constructive Proofs of Concentration Bounds
- Walking randomly, massively, and efficiently
- Fast distributed random walks
- Optimal deterministic routing and sorting on the congested clique
- Efficient distributed random walks with applications
- MST in Log-Star Rounds of Congested Clique
- Distributed Computation of Large-scale Graph Problems
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient