Streaming algorithms for independent sets

Authors:
Bjarni V. Halldórsson;Magnús M. Halldórsson;Elena Losievskaja;Mario Szegedy
Affiliations:
School of Science and Engineering, Reykjavik University, Reykjavik, Iceland;School of Computer Science, Reykjavik University;School of Computer Science, Reykjavik University;Dept. of Computer Science, Rutgers University, Piscataway, New Jersey
Venue:
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Year:
2010

Citing 9
Cited 2

The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
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
Online independent sets

Theoretical Computer Science
Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Finding Large Independent Sets in Graphs and Hypergraphs

SIAM Journal on Discrete Mathematics
Trading off space for passes in graph streaming problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On graph problems in a semi-streaming model

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Graph Sparsification in the Semi-streaming Model

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Graph Distances in the Data-Stream Model

SIAM Journal on Computing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We find "combinatorially optimal" (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also propose a new output-efficient streaming model, that is more restrictive than semi-streaming (n ċ logO(1) n space) but more flexible than classic streaming (logO(1) n space). The algorithms in this model work in poly-logarithmic space, like in the case of the classical streaming model, but they can access and update the output buffer, treating it as an extra piece of memory. Our results form the first treatment of the classic IS problem in the streaming setting.