@article {102,
	title = {Pre-processing and Path Normalization of a web graph used as a social network},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2007},
	pages = {262 - 276},
	abstract = {Many efforts have been made for compression of web graphs. Most of these methods are suitable for search engines and are centered around encoding links and URLs efficiently. The purpose is to handle a large set of web pages in the main memory against any web based search. The authors of the present paper are interested in studying web graph as a social network and to develop a data model for it. So, suitable compression techniques, which are space efficient for disk based storage, are required. This paper has provided a two level compression technique. In the first level, the structural properties of a graph are studied and strongly connected components are fused to reduce the original graph to a DAG. Paths on this DAG are then stored efficiently using a Path Normalization technique. Space complexity expressions indicate the efficiency of the method. Relevant operators required for accessing the original graph through the compressed representations have also been discussed. Important earlier works have been referred to indicate the requirements of the present approach.},
	keywords = {Compression technique, Path normailisation technique, Social software, Web search},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-57949092373\&partnerID=40\&md5=08a3428b63ad14c630820944a0e9c222},
	author = {Teja, C.B. and Mitra, S. and Bagchi, A. and Bandyopadhyay, A.K.}
}
