Optimally reconstructing weighted graphs using queries
From MaRDI portal
Recommendations
Cited in
(20)- Reconstituting beta graphs into an efficacious system
- Reconstruction and verification of chordal graphs with a distance oracle
- Reconstructing weighted graphs with minimal query complexity
- Exact learning from an honest teacher that answers membership queries
- Optimal query complexity for reconstructing hypergraphs
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
- Reconstructing weighted graphs with minimal query complexity
- Computing exact minimum cuts without knowing the graph
- Optimal reconstruction of graphs under the additive model
- Optimal reconstruction of graphs under the additive model
- Exact learning of weighted graphs using composite queries
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Learning spanning forests optimally in weighted undirected graphs with CUT queries
- A query algorithm for learning a spanning forest in weighted undirected graphs
- Learning partitions using rank queries
- Network verification via routing table queries
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
- Algorithms that access the input via queries
- Reconstructing Markov processes from independent and anonymous experiments
- Optimal query complexity bounds for finding graphs
This page was built for publication: Optimally reconstructing weighted graphs using queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417652)
