Greedy is optimal for single-pass semi-streaming matching
This is a metadata entry for an academic paper titled 'Semi-Streaming Matching in a Single Pass II: Greedy is Optimal' by Sepehr Assadi. It provides links to the arXiv preprint and various academic research tools.
Why it matters
It highlights advancements in algorithmic efficiency for graph matching, which is critical for large-scale data processing and network optimization.
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Sepehr Assadi [ view email ] [v1] Thu, 16 Jul 2026 07:22:45 UTC (39 KB) [v2] Mon, 20 Jul 2026 02:47:00 UTC (39 KB) Full-text links: Access Paper: View a PDF of the paper titled Semi-Streaming Matching in a Single Pass II: Greedy is Optimal, by Sepehr Assadi and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.DS < prev | next > new | recent | 2026-07 Change to browse by: cs cs.CC References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps?
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in