arXiv (All)
open access
Faster Sublinear Maximal Independent Set Size
We give a sublinear-time algorithm for estimating the size of a maximal independent set in a graph using adjacency-query access with expected running time $\tilde{O}(n^{1+1/3})$, improving over the previous $\tilde{O}(n^{1+1/2})$ bound of Mahadabi et al. [MRTV26]. As a consequence of a reduction of
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
- Bounded Independence Edge Subsampling in Graphs#347579
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#670289
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#668224
- Settling the Pass Complexity of Streaming Set Cover#1155942
- Parameterized Complexity of Spanner Problems with Independent Weights and Lengths#1077188
Record · ID 1188299
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