Exact learning of multitrees and almost-trees using path queries
From MaRDI portal
Publication:6109014
DOI10.1007/978-3-031-20624-5_18arXiv2208.04216OpenAlexW4312874092MaRDI QIDQ6109014
Michael T. Goodrich, Ramtin Afshar
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.04216
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the longest path algorithm for reconstructing trees from distance matrices
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Optimal query complexity bounds for finding graphs
- The multi-tree approach to reliability in distributed networks
- An optimal algorithm to reconstruct trees from additive distance data
- Circuit and decision tree complexity of some number theoretic problems
- 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
- The Query Complexity of Finding a Hidden Permutation
- Learning a Bounded-Degree Tree Using Separator Queries
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Parallelism in Comparison Problems
- Constructing Computer Virus Phylogenies
- The spectra of wrapped butterfly digraphs
- Graph reconstruction with a betweenness oracle
- From query complexity to computational complexity
- Decision tree complexity and Betti numbers
- Exact learning of multitrees and almost-trees using path queries
This page was built for publication: Exact learning of multitrees and almost-trees using path queries
