arXiv (All)
open access
Testing Connectedness and Edge Connectedness
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 $Ω(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Approximate-Master-Equation Formulation of the Watts Threshold Model on Hypergraphs#1342311
- Partial orders and monotonicity of logarithmic depth and height in preferential attachment trees#670494
- Partial orders and monotonicity of logarithmic depth and height in preferential attachment trees#668429
- Distributed Hypothesis Testing Against Dependence#1248544
- Reduced spread of nodes in spatial network models improves topology associated with increased computational capabilities#156711
Record · ID 1356635
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive