A note on finding optimum branchings. Networks (1979)

by P M Camerini, L Fratta, F Maffioli
Results 1 - 1 of 1

Towards Compressing Web Graphs

by Micah Adler, Michael Mitzenmacher - In Proc. of the IEEE Data Compression Conference (DCC , 2000
"... In this paper, we consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently proposed random graph models for describing the Web. ..."
Abstract - Cited by 68 (1 self) - Add to MetaCart
In this paper, we consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently proposed random graph models for describing the Web.