Harvard DASH
metadata only
Bounded Independence Edge Subsampling in Graphs
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
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#670289
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#668224
- Joint Estimation of Sparse Multilayer Networks via Graph Limits#609692
- Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number#1051089
- Reflection of optimal supports for k-wise independent bits#1061233
Record · ID 347579
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