Local Partitioning for Directed Graphs Using PageRank
From MaRDI portal
Publication:3078595
DOI10.1080/15427951.2008.10129297zbMath1206.68347OpenAlexW3031952539MaRDI QIDQ3078595
Kevin J. Lang, Reid Andersen, Fan R. K. Chung
Publication date: 28 February 2011
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1259158595
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)
Related Items (7)
Unnamed Item ⋮ Unnamed Item ⋮ Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic ⋮ Oriented spanning trees and stationary distribution of digraphs ⋮ Extreme values of the stationary distribution of random walks on directed graphs ⋮ A Dynamical System for PageRank with Time-Dependent Teleportation ⋮ The Buck-Passing Game
This page was built for publication: Local Partitioning for Directed Graphs Using PageRank
