Bookmark-Coloring Algorithm for Personalized PageRank Computing

DOI10.1080/15427951.2006.10129116zbMath1113.68375OpenAlexW2039191721MaRDI QIDQ3431005

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

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

Related Items (8)

Can we locally compute sparse connected subgraphs? ⋮ Red light green light method for solving large Markov chains ⋮ Constructing near spanning trees with few local inspections ⋮ The power method and beyond ⋮ Ranking and Sparsifying a Connection Graph ⋮ Sampling from complex networks with high community structures ⋮ Local algorithms for sparse spanning graphs ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks

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