Pre-compression algorithm for link structure of the web

Abstract

We introduce a new algorithm for compressing the link structure of the web graph by means of re-indexing the nodes in some web communities in order to decrease the differences between the numerical values of indices of these nodes. This is especially done for the nodes that participate in the adjacency lists of many nodes. Our algorithm will then partition… (More)

Topics

7 Figures and Tables

Slides referencing similar topics