An algorithm for enumerating SCCs in web graph

Abstract

The pages and their hyperlinks of the World-Wide Web can be viewed as nodes and edges of a directed graph, i.e. the Web Graph. To study the connectivity and structure of the graph, strongly connected component (SCC) analysis is important. When the graph contains hundreds of millions of nodes and billions of edges, it's difficult to use traditional algorithm because of the intractability for both time and space. In this paper, we investigate some properties of web graph, and propose a feasible algorithm for enumerating its SCCs. © Springer-Verlag Berlin Heidelberg 2005.