Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
From MaRDI portal
Publication:3520066
DOI10.1007/978-3-540-75225-7_24zbMath1142.68404MaRDI QIDQ3520066
Publication date: 19 August 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75225-7_24
68Q32: Computational learning theory
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the longest path algorithm for reconstructing trees from distance matrices
- An optimal algorithm to reconstruct trees from additive distance data
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Property testing and its connection to learning and approximation
- Learning a Hidden Matching
- Learning Theory
- Learning a Hidden Subgraph
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Optimal reconstruction of graphs under the additive model