A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

DOI10.1007/978-3-540-95995-3_6MaRDI QIDQ3601169zbMATH OpenOpenAlexFDO

Authors Fan Chung

Publication date 10 February 2009

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-95995-3_6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Recommendations

• A local graph partitioning algorithm using heat kernel pagerank
• Using PageRank to Locally Partition a Graph
• Local partitioning for directed graphs using pagerank

Cited in

(10)

• Four proofs for the Cheeger inequality and graph partition algorithms
• Local partitioning for directed graphs using pagerank
• Distributed algorithms for finding local clusters using heat kernel PageRank
• Using PageRank to Locally Partition a Graph
• From quasirandom graphs to graph limits and graphlets
• Solving local linear systems with boundary conditions using heat kernel pagerank
• A local graph partitioning algorithm using heat kernel pagerank
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Local Partitioning for Directed Graphs Using PageRank
• Sublinear Algorithms for Local Graph-Centrality Estimation

This page was built for publication: A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank

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