A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
From MaRDI portal
Publication:5388289
DOI10.1080/15427951.2009.10390643zbMath1238.05208OpenAlexW3031108707MaRDI QIDQ5388289
Publication date: 18 April 2012
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1318269500
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (max. 100)
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Computing heat kernel PageRank and a local clustering algorithm ⋮ Random walks and diffusion on networks ⋮ Sublinear Algorithms for Local Graph-Centrality Estimation ⋮ Partitioning Well-Clustered Graphs: Spectral Clustering Works! ⋮ Local Flow Partitioning for Faster Edge Connectivity
This page was built for publication: A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank