An algorithm for enumerating SCCs in web graph

Authors:
Jie Han;Yong Yu;Guowei Liu;Guirong Xue
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Year:
2005

Citing 4
Cited 1

Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Data Structures and Algorithms

Data Structures and Algorithms
On Identifying Strongly Connected Components in Parallel

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Towards Compressing Web Graphs

DCC '01 Proceedings of the Data Compression Conference

Graph structure of the Korea web

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications

Quantified Score

Hi-index	0.00

Visualization

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.