Reconstructing Weighted Graphs with Minimal Query Complexity
From MaRDI portal
Publication:3648745
DOI10.1007/978-3-642-04414-4_12zbMath1262.68060OpenAlexW2178947270MaRDI QIDQ3648745
Nader H. Bshouty, Hanna Mazzawi
Publication date: 1 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04414-4_12
Related Items (3)
Optimal query complexity bounds for finding graphs ⋮ Toward a deterministic polynomial time algorithm with optimal additive query complexity ⋮ On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Learning a Hidden Matching
- Learning Theory
- Learning a Hidden Subgraph
- On a lemma of Littlewood and Offord
- Graph-Theoretic Concepts in Computer Science
- Optimal reconstruction of graphs under the additive model
This page was built for publication: Reconstructing Weighted Graphs with Minimal Query Complexity