Bookmark-Coloring Algorithm for Personalized PageRank Computing

DOI10.1080/15427951.2006.10129116MaRDI QIDQ3431005zbMATH OpenOpenAlexFDO

Authors Pavel Berkhin

Publication date 5 April 2007

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2006.10129116

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Nonnumerical algorithms (68W05)

Recommendations

• A Survey on PageRank Computing
• Algorithms and Models for the Web-Graph
• Approximating Personalized PageRank with Minimal Use of Web Graph Data
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• On accelerating the PageRank computation

Cited in

(10)

• The power method and beyond
• Local algorithms for sparse spanning graphs
• Can we locally compute sparse connected subgraphs?
• Red light green light method for solving large Markov chains
• Sampling from complex networks with high community structures
• Constructing near spanning trees with few local inspections
• Ranking and sparsifying a connection graph
• Sublinear column-wise actions of the matrix exponential on social networks
• Randomly sparsified Richardson iteration: a dimension-independent sparse linear solver
• Approximating single-source personalized pagerank with absolute error guarantees

This page was built for publication: Bookmark-Coloring Algorithm for Personalized PageRank Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431005)