Detecting sharp drops in PageRank and a simplified local partitioning algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4484 LNCS, Issue , 2007, Pages 1-12

  Andersen, Reid ^a   Chung, Fan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; VECTORS;

LOCAL PARTITIONING ALGORITHM; PAGERANK VECTOR; SHARP DROPS; SMALL CONDUCTANCE;

COMPUTATIONAL METHODS;

EID: 35448943485     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72504-6_1     Document Type: Conference Paper

References (8)

1. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using PageRank vectors. In Proc. 47th Annual Symposium on Foundations of Computer Science, (2006).
2. P. Berkhin, Bookmark-Coloring Approach to Personalized PageRank Computing, Internet Mathematics, to appear.
3. S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, (1998), 107-117.
4. D. Fogaras and B. Racz, Towards scaling fully personalized PageRank, Proceedings of the 3rd Workshop on Algorithms and Models for the Web-Graph (WAW), (2004), 105-117.
5. T. H. Haveliwala, Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search, IEEE Trans. Knowl. Data Eng., (2003), 784-796.
6. G. Jeh and J. Widom, Scaling personalized web search, Proceedings of the 12th World Wide Web Conference (WWW), (2003), 271-279.
7. L. Page, S. Brin, R. Motwani and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, Stanford Digital Library Technologies Project, 1998.
8. D. A. Spielman and S.-H. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, ACM STOC (2004), 81-90.