A parallel pagerank algorithm for undirected graph

DOI10.1016/j.amc.2023.128276arXiv2112.01743MaRDI QIDQ6095043

No author found.

Publication date: 11 October 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.01743

zbMATH Keywords

parallelundirected graphChebyshev polynomialpagerank

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Graph theory (05Cxx) Markov processes (60Jxx)

Cites Work

• Unnamed Item
• Adaptive methods for the computation of PageRank
• PageRank Beyond the Web
• A Power–Arnoldi algorithm for computing PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Distributed Random Walks
• A Survey on PageRank Computing

This page was built for publication: A parallel pagerank algorithm for undirected graph