Journal article · 2026 · Open access
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
Journal of the ACM, 73(4), 1–83 · Published 16 June 2026 · DOI 10.1145/3820493
In brief
“Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams” is a 2026 journal article by Sepehr Assadi and 4 co-authors, published in Journal of the ACM. OpenAlex counts 4 citations as of 18 November 2026, which puts it in the top 3% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at Journal of the ACM.
- Citations
- 4
- Most cited in
- 2026 (4)
- Field-weighted impact
- 6.64
- References
- 73
- Authors
- 5
Abstract
A semi-streaming algorithm in dynamic graph streams processes any n -vertex graph by making one or multiple passes over a stream of insertions and deletions to edges of the graph and using O(n . polylog( n )) space. Semi-streaming algorithms for dynamic streams were first obtained in the seminal work of Ahn, Guha, and McGregor in 2012, alongside the introduction of the graph sketching technique, which remains the de facto way of designing algorithms in this model and a highly popular technique for designing graph algorithms in general. We settle the pass complexity of approximating maximum matchings in dynamic streams via semi-streaming algorithms by improving the state-of-the-art in both upper and lower bounds: — We present a randomized sketching based semi-streaming algorithm for O (1)-approximation of maximum matching in dynamic streams using O (log log n ) passes. The approximation ratio of this algorithm can be improved to (1+ɛ) for any fixed ɛ > 0 even on weighted graphs using standard techniques. This exponentially improves upon several O (log n ) pass algorithms developed for this problem since the introduction of the dynamic graph streaming model. — We prove that any semi-streaming algorithm (not only sketching based) for O (1)-approximation of maximum matching in dynamic streams requires Ω (log log n ) passes. This presents the first multi-pass lower bound for this problem, which is already also optimal, settling a longstanding open question in this area.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Assadi, S., Behnezhad, S., Konrad, C., Naidu, K. K., & Sundaresan, J. (2026). Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. Journal of the ACM, 73(4), 1–83. https://doi.org/10.1145/3820493
MLA 9
Assadi, Sepehr, et al. “Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.” Journal of the ACM, vol. 73, no. 4, 2026, pp. 1–83. https://doi.org/10.1145/3820493.
Chicago
Assadi, Sepehr, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, and Janani Sundaresan. 2026. “Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.” Journal of the ACM 73 (4): 1–83. https://doi.org/10.1145/3820493.
Harvard
Assadi, S. et al. (2026) ‘Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams’, Journal of the ACM, 73(4), pp. 1–83. doi:10.1145/3820493.
IEEE
S. Assadi, S. Behnezhad, C. Konrad, K. K. Naidu, and J. Sundaresan, “Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams,” Journal of the ACM, vol. 73, no. 4, pp. 1–83, 2026, doi: 10.1145/3820493.
BibTeX
@article{assadi2026settling,
title = {{Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams}},
author = {Assadi, Sepehr and Behnezhad, Soheil and Konrad, Christian and Naidu, Kheeran K. and Sundaresan, Janani},
journal = {Journal of the ACM},
year = {2026},
volume = {73},
number = {4},
pages = {1--83},
doi = {10.1145/3820493},
url = {https://doi.org/10.1145/3820493}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- semi-streaming algorithms
- lower bounds
- graph sketching
- randomized algorithms
- weighted graphs
- indels
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Assadi, S., Behnezhad, S., Konrad, C., Naidu, K. K., & Sundaresan, J. (2026). Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. Journal of the ACM, 73(4), 1–83. https://doi.org/10.1145/3820493
How many times has this paper been cited?
4 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Journal of the ACM: sign in and open the full text from this page.
Who wrote this paper?
Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan.
What is the DOI of this paper?
10.1145/3820493, permanently at https://doi.org/10.1145/3820493. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.