arXiv (OAI Expanded)
open access
Complexity of learning matchings and half graphs via edge queries
The problem of learning or reconstructing an unknown graph from a known family via partial-information queries arises as a mathematical model in various contexts. The most basic type of access to the graph is via \emph{edge queries}, where an algorithm may query the presence/absence of an edge betwe
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
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Formalize, Don't Optimize: The Heuristic Trap in LLM-Generated Combinatorial Solvers#178911
- Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles#923083
- Odd Cycle Transversal on $H$-free graphs#1105459
- Strengthening Recursive Constructions for Zero-Error Shannon Capacity#799488
Record · ID 1069663
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