Pages that link to "Item:Q2431425"
From MaRDI portal
The following pages link to Reconstructing weighted graphs with minimal query complexity (Q2431425):
Displaying 8 items.
- Signature codes for noisy multiple access adder channel (Q510479) (← links)
- Network verification via routing table queries (Q743125) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Optimal Query Complexity for Reconstructing Hypergraphs (Q3113744) (← links)
- Computing exact minimum cuts without knowing the graph (Q4993305) (← links)
- Optimal reconstruction of graphs under the additive model (Q5915407) (← links)