Sciweavers

Share
162 search results - page 1 / 33
» Local Graph Partitioning using PageRank Vectors
Sort
View
FOCS
2006
IEEE
9 years 6 months ago
Local Graph Partitioning using PageRank Vectors
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
IM
2007
9 years 2 days ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
8 years 10 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas
WAW
2007
Springer
159views Algorithms» more  WAW 2007»
9 years 6 months ago
Local Partitioning for Directed Graphs Using PageRank
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
WAW
2007
Springer
113views Algorithms» more  WAW 2007»
9 years 6 months ago
Local Computation of PageRank Contributions
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
books