Document Open Access Logo

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time

Authors Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2021.48.pdf
  • Filesize: 0.83 MB
  • 17 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • streaming algorithms
  • matching
  • parameterized algorithms
  • lower bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We present streaming algorithms for the graph k-matching problem in both the insert-only and dynamic models. Our algorithms, while keeping the space complexity matching the best known upper bound, have optimal or near-optimal update time, significantly improving on previous results. More specifically, for the insert-only streaming model, we present a one-pass randomized algorithm that runs in optimal 𝒪(k²) space and has optimal 𝒪(1) update time, and that, w.h.p. (with high probability), computes a maximum weighted k-matching of a weighted graph. Previously, the best upper bound on the update time was 𝒪(log k), which was achieved by a deterministic streaming algorithm that however only works for unweighted graphs [Stefan Fafianie and Stefan Kratsch, 2014]. For the dynamic streaming model, we present a one-pass randomized algorithm that, w.h.p., computes a maximum weighted k-matching of a weighted graph in Õ(Wk²) space and with Õ(1) update time, where W is the number of distinct edge weights. Again the update time of our algorithm improves the previous best upper bound Õ(k²) [Rajesh Chitnis et al., 2016]. Moreover, we prove that in the dynamic streaming model, any randomized streaming algorithm for the problem requires k²⋅ Ω(W(log W+1)) bits of space. Hence, both the space and update-time complexities achieved by our algorithm in the dynamic model are near-optimal. A streaming approximation algorithm for k-matching is also presented, whose space complexity matches the best known upper bound with a significantly improved update time.

Cite As Get BibTex

Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia. Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 48:1-48:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.ISAAC.2021.48

Author Details

Jianer Chen
  • Department of Computer Science & Engineering, Texas A&M University, College Station, TX, USA
Qin Huang
  • Department of Computer Science & Engineering, Texas A&M University, College Station, TX, USA
Iyad Kanj
  • School of Computing, DePaul University, Chicago, IL, USA
Qian Li
  • Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
Ge Xia
  • Department of Computer Science, Lafayette College, Easton, PA, USA

References

  1. Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. Graph sketches: sparsification, spanners, and subgraphs. In Proceedings of the 31st ACM Symposium on Principles of Database Systems (PODS '12), pages 5-14, 2012. Google Scholar
  2. KookJin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, and Anthony Wirth. Correlation clustering in data streams. In Proceedings of the 32nd International Conference on Machine Learning (ICML '15), pages 2237-2246, 2015. Google Scholar
  3. J. Alman and H. Yu. Faster update time for turnstile streaming algorithms. In Proceedings of the 31st annual ACM-SIAM symposium on Discrete algorithms (SODA '20), pages 1803-1813, 2020. Google Scholar
  4. Sepehr Assadi, Sanjeev Khanna, and Yang Li. On estimating maximum matching size in graph streams. In Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '17), pages 1723-1742, 2017. Google Scholar
  5. Sepehr Assadi, Sanjeev Khanna, Yang Li, and Grigory Yaroslavtsev. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16), pages 1345-1364, 2016. Google Scholar
  6. Jianer Chen, Ying Guo, and Qin Huang. Linear-time parameterized algorithms with limited local resources. arXiv preprint, 2020. URL: http://arxiv.org/abs/2003.02866.
  7. Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, and Sofya Vorotnikova. Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In Proceedings of the 27th annual ACM-SIAM symposium on Discrete algorithms (SODA '16), pages 1326-1344, 2016. Google Scholar
  8. Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, and Morteza Monemizadeh. New streaming algorithms for parameterized maximal matching and beyond. In Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '15), pages 56-58, 2015. Google Scholar
  9. Rajesh Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, and Morteza Monemizadeh. Parameterized streaming: Maximal matching and vertex cover. In Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '15), pages 1234-1251, 2015. Google Scholar
  10. Kenneth L. Clarkson and David P. Woodruff. Numerical linear algebra in the streaming model. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pages 205-214. ACM, 2009. Google Scholar
  11. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2009. Google Scholar
  12. Graham Cormode and Donatella Firmani. A unifying framework for 𝓁₀-sampling algorithms. Distributed and Parallel Databases, 32(3):315-335, 2014. Google Scholar
  13. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, USA, 2006. Google Scholar
  14. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  15. Reinhard Diestel. Graph Theory (Graduate Texts in Mathematics). Springer, 2005. Google Scholar
  16. Stefan Fafianie and Stefan Kratsch. Streaming kernelization. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science 2014 (MFCS '14), pages 275-286, 2014. Google Scholar
  17. Harold N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90), pages 434-443. SIAM, 1990. Google Scholar
  18. Harold N. Gabow. Data structures for weighted matching and extensions to b-matching and f-factors. ACM Transactions on Algorithms, 14(3), 2018. Google Scholar
  19. Ashish Goel, Michael Kapralov, and Sanjeev Khanna. On the communication and streaming complexity of maximum bipartite matching. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '12), pages 468-485, 2012. Google Scholar
  20. Ashish Goel, Michael Kapralov, and Ian Post. Single pass sparsification in the streaming model with edge deletions. arXiv preprint, 2012. URL: http://arxiv.org/abs/1203.4900.
  21. Michael Kapralov. Better bounds for matchings in the streaming model. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '13), pages 1679-1697, 2013. Google Scholar
  22. Michael Kapralov, Sanjeev Khanna, and Madhu Sudan. Approximating matching size from random streams. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '14), pages 734-751, 2014. Google Scholar
  23. Michael Kapralov and David Woodruff. Spanners and sparsifiers in dynamic streams. In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing (PODC '14), pages 272-281, 2014. Google Scholar
  24. Christian Konrad and Adi Rosén. Approximating semi-matchings in streaming and in two-party communication. In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP '13), pages 637-649, 2013. Google Scholar
  25. K. Larsen, J. Nelson, and H. Nguyen. Time lower bounds for nonadaptive turnstile streaming algorithms. In Proceedings of the 47st Annual ACM Symposium on Theory of Computing STOC'15, pages 803-812. ACM, 2015. Google Scholar
  26. Roie Levin and David Wajc. Streaming submodular matching meets the primal-dual method. arXiv preprint, to appear in SODA '21, 2020. URL: http://arxiv.org/abs/2008.10062.
  27. George B. Mertzios, André Nichterlein, and Rolf Niedermeier. A linear-time algorithm for maximum-cardinality matching on cocomparability graphs. SIAM Journal on Discrete Mathematics, 32(4):2820-2835, 2018. Google Scholar
  28. George B. Mertzios, André Nichterlein, and Rolf Niedermeier. The power of linear-time data reduction for maximum matching. Algorithmica, 82(12):3521-3565, 2020. Google Scholar
  29. Peter B. Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998. Google Scholar
  30. Michael Mitzenmacher and Eli Upfal. Probability and Computing. Cambridge University Press, 2nd edition, 2017. Google Scholar
  31. Ami Paz and Gregory Schwartzman. A (2+ε)-approximation for maximum weight matching in the semi-streaming model. ACM Transaction on Algorithms, 15(2):18:1-18:15, 2019. Google Scholar
  32. Tim Roughgarden. Communication complexity (for algorithm designers). arXiv preprint, 2015. URL: http://arxiv.org/abs/1509.06257.
  33. Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223-250, 1995. Google Scholar
  34. M. Thorup and Y. Zhang. Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation. SIAM J. Comput., 41(2):293-331, 2012. Google Scholar
  35. Salil P. Vadhan. Pseudorandomness. Foundations and Trends in Theoretical Computer Science, 7(1-3):1-336, 2012. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact