Reconstruction and verification of chordal graphs with a distance oracle
From MaRDI portal
Publication:2227489
DOI10.1016/j.tcs.2021.01.006zbMath1497.68395OpenAlexW3118852340MaRDI QIDQ2227489
Jianxin Wang, Yongjie Yang, Wenjun Li, Guozhen Rong
Publication date: 15 February 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.01.006
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries ⋮ Exact learning of multitrees and almost-trees using path queries ⋮ Unnamed Item
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
- Reconstructing weighted graphs with minimal query complexity
- Representation of a finite graph by a set of intervals on the real line
- Network Discovery and Verification with Distance Queries
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Graph Classes: A Survey
- Graph reconstruction with a betweenness oracle
- Graph Reconstruction and Verification
- Learning a Hidden Matching
- Graph-Theoretic Concepts in Computer Science
- Optimal reconstruction of graphs under the additive model
This page was built for publication: Reconstruction and verification of chordal graphs with a distance oracle
