Title

Graph-theoretic Web algorithms: An overview

Authors

Authors

N. Deo;P. Gupta

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Keywords

Computer Science, Software Engineering; Computer Science, Theory &; Methods; Telecommunications

Abstract

The World Wide Web is growing rapidly and revolutionizing the means of information access. It can be modeled as a directed graph in which a node represents a Web page and an edge represents a hyperlink. Currently the number of nodes in this gigantic Web graph is over four billion and is growing by more than seven million nodes a day-without any centralized control. The study of this graph is essential for designing efficient algorithms for crawling, searching, and ranking Web resources. Knowledge of the structure of the Web graph can be also exploited for attaining efficiency and comprehensiveness in Web navigation. This paper describes algorithms for graph-theoretic analysis of the Web.

Journal Title

Innovative Internet Computing Systems, Proceedings

Volume

2060

Publication Date

1-1-2001

Document Type

Article

Language

English

First Page

91

Last Page

102

WOS Identifier

WOS:000174223500008

ISSN

0302-9743; 3-540-42275-7

Share

COinS