Local Partitioning for Directed Graphs Using PageRank
From MaRDI portal
Publication:5458309
DOI10.1007/978-3-540-77004-6_13zbMath1136.68317MaRDI QIDQ5458309
Reid Andersen, Kevin J. Lang, Fan R. K. 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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, Multicommodity Allocation for Dynamic Demands Using PageRank Vectors, 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, Clustering and community detection in directed networks: a survey, Finding Cheeger cuts in hypergraphs via heat equation, Online probabilistic theory revision from examples with ProPPR, Asymptotic analysis for personalized Web search