Data structures and network algorithms
Data structures and network algorithms
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
Fast parallel algorithms for graph matching problems
Fast parallel algorithms for graph matching problems
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Parallel approximation algorithms for maximum weighted matching in general graphs
Information Processing Letters
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
An Approximate L1-Difference Algorithm for Massive Data Streams
SIAM Journal on Computing
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Generating Sparse Spanners for Weighted Graphs
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
On finding common neighborhoods in massive graphs
Theoretical Computer Science
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Extremal Graph Theory
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Estimating statistical aggregates on probabilistic data streams
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A near-optimal algorithm for computing the entropy of a stream
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A linear time deterministic algorithm to find a small subset that approximates the centroid
Information Processing Letters
Declaring independence via the sketching of sketches
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Estimating statistical aggregates on probabilistic data streams
ACM Transactions on Database Systems (TODS)
Optimal sampling from sliding windows
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Graph Sparsification in the Semi-streaming Model
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A near-optimal algorithm for estimating the entropy of a stream
ACM Transactions on Algorithms (TALG)
Maintaining a large matching and a small vertex cover
Proceedings of the forty-second ACM symposium on Theory of computing
Streaming algorithms for independent sets
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Streaming graph computations with a helpful advisor
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fully decentralized computation of aggregates over data streams
ACM SIGKDD Explorations Newsletter
Theoretical Computer Science
Dynamic approximate vertex cover and maximum matching
Property testing
Dynamic approximate vertex cover and maximum matching
Property testing
Filtering: a method for solving graph problems in MapReduce
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Buyback problem: approximate matroid intersection with cancellation costs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
gSketch: on query estimation in graph streams
Proceedings of the VLDB Endowment
Analyzing graph structure via linear measurements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the communication and streaming complexity of maximum bipartite matching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Of hammers and nails: an empirical comparison of three paradigms for processing large graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Densest subgraph in streaming and MapReduce
Proceedings of the VLDB Endowment
Drawing trees in a streaming model
Information Processing Letters
Graph sketches: sparsification, spanners, and subgraphs
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The relationship between inner product and counting cycles
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Space-constrained interval selection
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Streaming and communication complexity of clique approximation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Graph synopses, sketches, and streams: a survey
Proceedings of the VLDB Endowment
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
Hi-index | 0.00 |
We formalize a potentially rich new streaming model, the semi-streaming model, that we believe is necessary for the fruitful study of efficient algorithms for solving problems on massive graphs whose edge sets cannot be stored in memory. In this model, the input graph, G = (V, E), is presented as a stream of edges (in adversarial order), and the storage space of an algorithm is bounded by O(n ċ polylog n), where n = |V|. We are particularly interested in algorithms that use only one pass over the input, but, for problems where this is provably insufficient, we also look at algorithms using constant or, in some cases, logarithmically many passes. In the course of this general study, we give semi-streaming constant approximation algorithms for the unweighted and weighted matching problems, along with a further algorithmic improvement for the bipartite case. We also exhibit log n/log log n semi-streaming approximations to the diameter and the problem of computing the distance between specified vertices in a weighted graph. These are complemented by Ω(log(1-ε) n) lower bounds.