Incremental page rank computation on evolving graphs

Prasanna Desikan, Nishith Pathak, Jaideep Srivastava, Vipin Kumar

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

51 Citations (Scopus)

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
Title of host publication14th International World Wide Web Conference, WWW2005
Pages1094-1095
Number of pages2
DOIs
Publication statusPublished - 1 Dec 2005
Event14th International World Wide Web Conference, WWW2005 - Chiba, Japan
Duration: 10 May 200514 May 2005

Publication series

Name14th International World Wide Web Conference, WWW2005

Other

Other14th International World Wide Web Conference, WWW2005
CountryJapan
CityChiba
Period10/5/0514/5/05

Keywords

  • Algorithm
  • Evolving graphs
  • PageRank
  • Web mining

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Desikan, P., Pathak, N., Srivastava, J., & Kumar, V. (2005). Incremental page rank computation on evolving graphs. In 14th International World Wide Web Conference, WWW2005 (pp. 1094-1095). (14th International World Wide Web Conference, WWW2005). https://doi.org/10.1145/1062745.1062885