0000000000714492
AUTHOR
A. L. Buchsbaum
Table Compression
Data Compression Techniques for massive tables are described. Related methodological results are also presented.
New results for finding common neighborhoods in massive graphs in the data stream model
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We give lower bounds for randomized, two-sided error algorithms that solve this problem in the data-stream model of computation. Our results correct and improve those of Buchsbaum, Giancarlo, and Westbrook [On finding common neighborhoods in massive graphs, Theoretical Computer Science, 299 (1–3) 707–718 (2004)]