Optimal reconstruction of graphs under the additive model
From MaRDI portal
Recommendations
Cited in
(37)- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Query complexity of mastermind variants
- Communication and location discovery in geometric ring networks
- Generalized framework for group testing: queries, feedbacks and adversaries
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
- Reconstruction and verification of chordal graphs with a distance oracle
- Reconstructing weighted graphs with minimal query complexity
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Exact learning from an honest teacher that answers membership queries
- Learning a bounded-degree tree using separator queries
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Reconstructing weighted graphs with minimal query complexity
- scientific article; zbMATH DE number 1222833 (Why is no real title available?)
- Learning a hidden graph
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- Tight complexity lower bounds for integer linear programming with few constraints
- Tight lower bounds for the complexity of multicoloring
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
- Automatic structure recovery for additive models
- Graph reconstruction via distance oracles
- Optimally reconstructing weighted graphs using queries
- Optimal reconstruction of graphs under the additive model
- Optimal channel utilization with limited feedback
- Optimal schemes for combinatorial query problems with integer feedback
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- Approximate message passing with rigorous guarantees for pooled data and quantitative group testing
- Learning a hidden uniform hypergraph
- Constructing large matchings via query access to a maximal matching oracle
- On the cut-query complexity of approximating max-cut
- Learning spanning forests optimally in weighted undirected graphs with CUT queries
- On a near-optimal and efficient algorithm for the sparse pooled data problem
- A query algorithm for learning a spanning forest in weighted undirected graphs
- Reconstruction of hidden graphs and threshold group testing
- Learning partitions using rank queries
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
- Reconstructing Markov processes from independent and anonymous experiments
- Optimal query complexity bounds for finding graphs
This page was built for publication: Optimal reconstruction of graphs under the additive model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915407)
