A sharp PageRank algorithm with applications to edge ranking and graph sparsification

DOI10.1007/978-3-642-18009-5_2MaRDI QIDQ3067503zbMATH OpenOpenAlexFDO

Authors Wen-Bo Zhao, Fan Chung

Publication date 21 January 2011

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-642-18009-5_2

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Internet topics (68M11)

Recommendations

• Using PageRank to Locally Partition a Graph
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• \texttt{PageRank} and random walks on graphs
• Ranking and sparsifying a connection graph
• PageRank optimization by edge selection

Cited in

(6)

• A local clustering algorithm for connection graphs
• Ranking and sparsifying a connection graph
• Finding and visualizing graph clusters using PageRank optimization
• On the edges’ PageRank and line graphs
• Ranking and sparsifying a connection graph
• Quick detection of top-\(k\) personalized PageRank lists

This page was built for publication: A sharp PageRank algorithm with applications to edge ranking and graph sparsification

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