New results for finding common neighborhoods in massive graphs in the data stream model

Authors:
A. L. Buchsbaum;R. Giancarlo;B. Racz
Affiliations:
Madison, NJ, USA;University of Palermo, Dipartimento di Matematica ed Applicazioni, Via Archirafi 34, 90123 Palermo, Italy;Computer and Automation Research Institute of the Hungarian Academy of Sciences (MTA SZTAKI), P.O. Box 63, Budapest, H-1518, Hungary and Department of Algebra, Budapest University of Technology an ...
Venue:
Theoretical Computer Science
Year:
2008

Citing 18
Cited 0

New asymptotics for bipartite Tura´n numbers

Journal of Combinatorial Theory Series A
Communication complexity

Communication complexity
On randomized one-round communication complexity

Computational Complexity
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Reductions in streaming algorithms, with an application to counting triangles in graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Mining Very Large Databases

Computer
Distributed Data Mining in Credit Card Fraud Detection

IEEE Intelligent Systems
Computing Iceberg Queries Efficiently

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On finding common neighborhoods in massive graphs

Theoretical Computer Science
The MIDAS Data-Mining Project at Stanford

IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Hancock: A language for analyzing transactional data streams

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An information statistics approach to data stream and communication complexity

Journal of Computer and System Sciences - Special issue on FOCS 2002
Extremal Graph Theory

Extremal Graph Theory
Graph distances in the streaming model: the value of space

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science
Gecko: tracking a very large billing system

ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference

Quantified Score

Hi-index	5.24

Visualization

Abstract

We 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)]