Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2021: Computing and Combinatorics pp 540–552Cite as

Single-Pass Streaming Algorithms to Partition Graphs into Few Forests

  • Conference paper
  • First Online:

  • 1101 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13025))

Abstract

We devise a single-pass O(n)-space deterministic streaming algorithm to partition any n-node undirected simple graph G into \(O(\alpha \log n)\) forests where \(\alpha \) is the minimum number of forests which G can be partitioned into. We then apply this result to obtain single-pass streaming algorithms for other graph problems, including low outdegree orientation, partitioning graphs into few planar subgraphs, and finding small dominating sets.

This research was supported in part by the Ministry of Science and Technology of Taiwan under contract MOST grant 109-2221-E-001-025-MY3.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ablayev, F.M.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theor. Comput. Sci. 157(2), 139–159 (1996)

    Article  MathSciNet  Google Scholar 

  2. Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: SODA, pp. 459–467 (2012)

    Google Scholar 

  3. Assadi, S., Chen, Y., Khanna, S.: Sublinear algorithms for (\(\varDelta \) + 1) vertex coloring. In: SODA, pp. 767–786 (2019)

    Google Scholar 

  4. Blumenstock, M., Fischer, F.: A constructive arboricity approximation scheme. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 51–63. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-38919-2_5

    Chapter  Google Scholar 

  5. Brodal, G.S., Fagerberg, R.: Dynamic representations of sparse graphs. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342–351. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48447-7_34

    Chapter  Google Scholar 

  6. Chang, Y., Farach-Colton, M., Hsu, T., Tsai, M.: Streaming complexity of spanning tree computation. In: STACS. LIPIcs, vol. 154, pp. 34:1–34:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)

    Google Scholar 

  7. Eden, T., Levi, R., Ron, D.: Testing bounded arboricity. ACM Trans. Algorithms 16(2), 18:1–18:22 (2020)

    Google Scholar 

  8. Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44(5), 669–696 (1997)

    Article  MathSciNet  Google Scholar 

  9. Farach-Colton, M., Tsai, M.-T.: Computing the degeneracy of large graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 250–260. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54423-1_22

    Chapter  Google Scholar 

  10. Farach-Colton, M., Tsai, M.-T.: Tight approximations of degeneracy in large graphs. In: Kranakis, E., Navarro, G., Chávez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 429–440. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49529-2_32

    Chapter  Google Scholar 

  11. Chartrand, G., Kronk, H.V., Wall, C.E.: The point-arboricity of a graph. Israel J. Math. 6, 169–175 (1968)

    Article  MathSciNet  Google Scholar 

  12. Gabow, H.N., Westermann, H.H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7(5 & 6), 465–497 (1992)

    Article  MathSciNet  Google Scholar 

  13. Guha, S., McGregor, A., Tench, D.: Vertex and hyperedge connectivity in dynamic graph streams. In: PODS, pp. 241–247 (2015)

    Google Scholar 

  14. Harris, D.G., Su, H., Vu, H.T.: On the locality of Nash-Williams forest decomposition and star-forest decomposition. CoRR abs/2009.10761 (2020)

    Google Scholar 

  15. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discret. Math. 5(4), 545–557 (1992)

    Article  MathSciNet  Google Scholar 

  16. Kapralov, M., Lee, Y.T., Musco, C., Musco, C., Sidford, A.: Single pass spectral sparsification in dynamic streams. SIAM J. Comput. 46(1), 456–477 (2017)

    Article  MathSciNet  Google Scholar 

  17. Kowalik, Ł: Approximation scheme for lowest outdegree orientation and graph density measures. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 557–566. Springer, Heidelberg (2006). https://doi.org/10.1007/11940128_56

    Chapter  MATH  Google Scholar 

  18. Lenzen, C., Wattenhofer, R.: Minimum dominating set approximation in graphs of bounded arboricity. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 510–524. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15763-9_48

    Chapter  Google Scholar 

  19. McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9–20 (2014)

    Article  Google Scholar 

  20. McGregor, A., Tench, D., Vorotnikova, S., Vu, H.T.: Densest subgraph in dynamic graph streams. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 472–482. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48054-0_39

    Chapter  Google Scholar 

  21. Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117–236 (2005)

    Article  MathSciNet  Google Scholar 

  22. Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39(1), 12 (1964)

    Article  MathSciNet  Google Scholar 

  23. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for their helpful comments.

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, Taipei, Taiwan

    Cheng-Hung Chiang & Meng-Tsung Tsai

Authors
  1. Cheng-Hung Chiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meng-Tsung Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meng-Tsung Tsai .

Editor information

Editors and Affiliations

  1. National Cheng Kung University, Tainan, Taiwan

    Chi-Yeh Chen

  2. National Tsing Hua University, Hsinchu, Taiwan

    Wing-Kai Hon

  3. National Taipei University of Business, Taoyuan, Taiwan

    Ling-Ju Hung

  4. National Taitung University, Taitung, Taiwan

    Chia-Wei Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chiang, CH., Tsai, MT. (2021). Single-Pass Streaming Algorithms to Partition Graphs into Few Forests. In: Chen, CY., Hon, WK., Hung, LJ., Lee, CW. (eds) Computing and Combinatorics. COCOON 2021. Lecture Notes in Computer Science(), vol 13025. Springer, Cham. https://doi.org/10.1007/978-3-030-89543-3_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89543-3_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89542-6

  • Online ISBN: 978-3-030-89543-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation