Metraipolis › archive › dc_2a28be0bd747
Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space — arXiv:2609.19136
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19136
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T17:11:25.025Z
- SHA-256 of the archived text
ae001ce8e3d9b93d8f031d83422cee691c173efa110c3a9844d385d98bdb889e- Stable URL of this page
https://metraipolis.com/documento/dc_2a28be0bd747
How to cite
Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space — arXiv:2609.19136 — arXiv (en), https://arxiv.org/abs/2609.19136 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2a28be0bd747 (Metraipolis archive dc_2a28be0bd747, sha256 ae001ce8e3d9b93d8f031d83422cee691c173efa110c3a9844d385d98bdb889e)
BibTeX
@misc{dc2a28be0bd747,
title = {Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $tildeO(n^2/3)$ space — arXiv:2609.19136},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19136},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2a28be0bd747; sha256 ae001ce8e3d9b93d8f031d83422cee691c173efa110c3a9844d385d98bdb889e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19136. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The paper presents a one-pass algorithm in the insert-delete graph stream model that returns a $(1+\varepsilon)(\alpha+2)$-approximation for the size of the maximum matching in a graph of arboricity at most $\alpha$. The algorithm uses $O(\varepsilon^{-4/3}\alpha^{4/3}n^{2/3} \text{polylog} n)$ space. For constant $\alpha$ and $\varepsilon$, this improves the best known previous space bound from $O(n^{4/5} \text{polylog} n)$ to $O(n^{2/3} \text{polylog} n)$. The algorithm is a linear sketch and requires no bounds on the number of deletions or on the arboricity of intermediate graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.19136 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T16:17:15.283Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).