, Volume 76, Issue 2, pp 490–501 | Cite as

Streaming Algorithms for Independent Sets in Sparse Hypergraphs

  • Bjarni V. Halldórsson
  • Magnús M. Halldórsson
  • Elena Losievskaja
  • Mario Szegedy


We give the first treatment of the classic independent set problem in graphs and hypergraphs in the streaming setting. The objective is to find space-efficient algorithms that output independent sets that are “combinatorially optimal”, that is, with size guarantee in terms of the degree sequence alone. Our main result is a randomized algorithm that achieves this using space in bits that is linear in the number of vertices. We use this to examine assumptions about the streaming model, and advocate the study of output-efficient algorithms that measure space usage relative to the size of the output solution. In that sense, our main algorithm uses space linear in the output size. We also examine algorithms that use little or no space in addition to the bits storing the output. Our algorithms fall also into an online streaming model, where output-changes can go only in one direction. In particular a feasible solution must be maintained at all times, and items that are removed from the solution can never reenter. We obtain tight bounds on deterministic algorithms for independent sets in graphs in that model.


Streaming algorithms Independent sets Turan bound  Online streaming 



We thank Páll Melsted for helpful discussions.


  1. 1.
    Ahn, K.J., Guha, S.: Graph sparsification in the semi-streaming model. In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, 5–12 July 2009, Proceedings, pp. 328–338 (2009)Google Scholar
  2. 2.
    Alon, N., Arad, U., Azar, Y.: Independent sets in hypergraphs with applications to routing via fixed paths. In: Proceedings of Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX’99, pp. 16–27 (1999)Google Scholar
  3. 3.
    Alon, N., Spencer, J.: The Probabilistic Method. Wiley, New York (1992)zbMATHGoogle Scholar
  4. 4.
    Caro, Y.: New Results on the Independence Number. Technical report, Tel-Aviv University (1979)Google Scholar
  5. 5.
    Caro, Y., Tuza, Z.: Improved lower bounds on k-independence. J. Graph Theory 15(1), 99–107 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Cormode, G., Mitzenmacher, M., Thaler, J.: Streaming graph computations with a helpful advisor. Algorithmica 65(2), 409–442 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Emek, Y., Halldórsson, M.M., Mansour, Y., Patt-Shamir, B., Radhakrishnan, J., Rawitz, D.: Online set packing. SIAM J. Comput. 41(4), 728–746 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Emek, Y., Halldórsson, M.M., Rosén, A.: Space-constrained interval selection. In: Automata, Languages, and Programming—39th International Colloquium, ICALP 2012, Warwick, UK, 9–13 July 2012, Proceedings, Part I, pp. 302–313 (2012)Google Scholar
  9. 9.
    Emek, Y., Rosén, A.: Semi-streaming set cover - (extended abstract). In: Automata, Languages, and Programming—41st International Colloquium, ICALP 2014, Copenhagen, Denmark, 8–11 July 2014, Proceedings, Part I, pp. 453–464 (2014)Google Scholar
  10. 10.
    Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251–1265 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2), 207–216 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput. 38(5), 1709–1727 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Halldórsson, B.V., Halldórsson, M.M., Losievskaja, E., Szegedy, M.: Streaming algorithms for independent sets. In: Automata, Languages and Programming—37th International Colloquium, ICALP, Bordeaux, France, Proceedings, pp. 641–652. Springer (2010)Google Scholar
  14. 14.
    Halldórsson, M.M., Iwama, K., Miyazaki, S., Taketomi, S.: Online independent sets. Theor. Comput. Sci. 289(2), 953–962 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Halldórsson, M.M., Sun, X., Szegedy, M., Wang, C.: Streaming and communication complexity of clique approximation. In: Automata, Languages, and Programming—39th International Colloquium, ICALP 2012, Warwick, UK, 9–13 July 2012, Proceedings, Part I, pp. 449–460 (2012)Google Scholar
  16. 16.
    Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117–236 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Shachnai, H., Srinivasan, A.: Finding large independent sets in graphs and hypergraphs. SIAM J. Discrete Math. 18(3), 488–500 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Turán, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436–452 (1941)MathSciNetGoogle Scholar
  19. 19.
    Wei, V.K.: A lower bound on the stability number of a simple graph. Technical Memorandum No. 81-11217-9, Bell Laboratories (1981)Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Bjarni V. Halldórsson
    • 1
  • Magnús M. Halldórsson
    • 2
  • Elena Losievskaja
    • 2
  • Mario Szegedy
    • 3
  1. 1.ICE-TCS, School of Science and EngineeringReykjavik University and deCODE geneticsReykjavíkIceland
  2. 2.ICE-TCS, School of Computer ScienceReykjavik UniversityReykjavíkIceland
  3. 3.Department of Computer ScienceRutgers UniversityPiscatawayUSA

Personalised recommendations