Metraipolis › archive › dc_f23cfdb4abe0
Testing Connectedness and Edge Connectedness — arXiv:2610.21299
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21299
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:40:20.756Z
- SHA-256 of the archived text
ba595eb0165312918154c2e0a51069a2cfd601fca2f44b7c164209e413f7789e- Stable URL of this page
https://metraipolis.com/documento/dc_f23cfdb4abe0
How to cite
Testing Connectedness and Edge Connectedness — arXiv:2610.21299 — arXiv (en), https://arxiv.org/abs/2610.21299 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f23cfdb4abe0 (Metraipolis archive dc_f23cfdb4abe0, sha256 ba595eb0165312918154c2e0a51069a2cfd601fca2f44b7c164209e413f7789e)
BibTeX
@misc{dcf23cfdb4abe0,
title = {Testing Connectedness and Edge Connectedness — arXiv:2610.21299},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21299},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f23cfdb4abe0; sha256 ba595eb0165312918154c2e0a51069a2cfd601fca2f44b7c164209e413f7789e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21299. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We revisit the classical problem of testing connectedness of graphs represented in the adjacency lists model and obtain optimal bounds. Specifically, we show that $\varepsilon$-testing connectedness of graphs with maximum degree at most $d$ requires $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon d})$ queries (when $\varepsilon \le \frac{1}{4d^5}$). Our result implies that the connectedness tester of Levi, Pallavoor, Raskhodnikova, and Varma ({\em ACM Trans.\ Comput.\ Theory, 2022}) is optimal. We also study the problem of testing $k$-edge-connectedness of both directed and undirected graphs of average degree $\overline{d}$ in the adjacency lists model and design a tester with query complexity $O(\frac{k}{\varepsilon} \log \frac{1}{\varepsilon \overline{d}})$, improving upon the bounds by Forster, Nanongkai, Saranurak, Yang, and Yingchareonthawornchai (SODA 2020). Furthermore, we complement our upper bound by showing that every one-sided error $k$-edge-connectedness tester must make $\Omega(k/\varepsilon)$ queries.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.21299 — 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-16T08:53:17.671Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).