Local Partitioning for Directed Graphs Using PageRank

DOI10.1007/978-3-540-77004-6_13MaRDI QIDQ5458309zbMATH OpenOpenAlexFDO

Authors Reid Andersen, Kevin J. Lang, Fan Chung

Publication date 11 April 2008

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77004-6_13

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Local partitioning for directed graphs using pagerank
• Using PageRank to Locally Partition a Graph
• A local graph partitioning algorithm using heat kernel pagerank
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

Cited in

(12)

• Finding Cheeger cuts in hypergraphs via heat equation
• Online probabilistic theory revision from examples with ProPPR
• Local partitioning for directed graphs using pagerank
• Asymptotic analysis for personalized web search
• Using PageRank to Locally Partition a Graph
• Multicommodity allocation for dynamic demands using PageRank vectors
• scientific article; zbMATH DE number 7626762 (Why is no real title available?)
• Clustering and community detection in directed networks: a survey
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• PageRank Nibble on the sparse directed stochastic block model
• Multi-linear pseudo-PageRank for hypergraph partitioning
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs

This page was built for publication: Local Partitioning for Directed Graphs Using PageRank

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