Towards compressing Web graphs
Authors:
- M. AdlerMAM. Adler
- M. MitzenmacherMMM. Mitzenmacher
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 203-212
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Graph structure in the WebComputer Networks, 2000
- A random graph model for massive graphs2000
- The Web as a Graph: Measurements, Models, and Methods1999
- Trawling the Web for emerging cyber-communitiesComputer Networks, 1999
- The Connectivity Server: fast access to linkage information on the WebComputer Networks and ISDN Systems, 1998
- Band ordering in lossless compression of multispectral imagesIEEE Transactions on Computers, 1997
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- A note on finding optimum branchingsNetworks, 1979
- Finding optimum branchingsNetworks, 1977
- A simple derivation of edmonds' algorithm for optimum branchingsNetworks, 1971