Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897540
Recommendations
Cited in
(19)- Reconstructing weighted graphs with minimal query complexity
- Nonadaptive algorithms for threshold group testing
- Learning a hidden uniform hypergraph
- Optimal query complexity bounds for finding graphs
- Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
- Reconstructing weighted graphs with minimal query complexity
- Exact learning from an honest teacher that answers membership queries
- Error-tolerant non-adaptive learning of a hidden hypergraph
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Learning a hidden graph
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
- Reconstructing Markov processes from independent and anonymous experiments
- Reconstruction of hidden graphs and threshold group testing
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Applications of graph theory in DNA sequencing by hybridization
- Non-adaptive learning of a hidden hypergraph
- Non-adaptive learning of a hidden hypergraph
This page was built for publication: Graph-Theoretic Concepts in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897540)