Towards compressing Web graphs

Data Compression Conference Proceedings

Volumn , Issue , 2001, Pages 203-212

  Adler, Micah ^a   Mitzenmacher, Michael ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; GRAPHIC METHODS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

COMPRESSING WEB GRAPHS; HUFFMAN BASED SCHEMES; MINIMUM SPANNING TREE;

WORLD WIDE WEB;

EID: 0035019833     PISSN: 10680314     EISSN: None     Source Type: Journal    
DOI: 10.1109/DCC.2001.917151     Document Type: Article

References (20)

1. Towards compressing web graphs
2. A random graph model for massive graphs
3. The connectivity server: Fast access to linkage information on the web
4. The anatomy of a large-scale hypertextual web search engine
5. Graph structure in the Web: Experiments and models
6. Engineering the compression of massive tables: An experimental approach
7. A note on finding optimum branchings
8. Approximation algorithms for directed Steiner problems
9. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
10. Overview of the TREC-8 Web track
11. A simple derivation of Edmonds' algorithm for optimum branchings
12. Authoritative sources in a hyperlinked environment
13. The web as a graph: Measurements, models, and methods
14. Trawling the web for emerging cyber-communities
15. Extracting large scale knowledge bases from the web
16. Improved graph models for the web
17. Band ordering in lossless compression of multispectral images
18. Finding optimum branchings