Incremental page rank computation on evolving graphs

Prasanna Desikan, Nishith Pathak, Jaideep Srivastava, Vipin Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

53 Scopus citations

Abstract

In this paper, we propose a method to incrementally compute PageRank for a large graph that is evolving. Our approach is quite general, and can be used to incrementally compute (on evolving graphs) any metric that satisfies the first order Markov property.

Original languageEnglish (US)
Title of host publication14th International World Wide Web Conference, WWW2005
Pages1094-1095
Number of pages2
DOIs
StatePublished - Dec 1 2005
Event14th International World Wide Web Conference, WWW2005 - Chiba, Japan
Duration: May 10 2005May 14 2005

Publication series

Name14th International World Wide Web Conference, WWW2005

Other

Other14th International World Wide Web Conference, WWW2005
CountryJapan
CityChiba
Period5/10/055/14/05

Keywords

  • Algorithm
  • Evolving graphs
  • PageRank
  • Web mining

Cite this