186 search results - page 1 / 38 » Speeding up algorithms on compressed web graphs |
WSDM
2009
ACM
13 years 11 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
STOC
1991
ACM
13 years 7 months ago
1991
ACM
WAW
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
CIAC
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
DCC
2008
IEEE
14 years 3 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...