A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
From MaRDI portal
Publication:2143136
DOI10.1016/j.tcs.2022.03.008MaRDI QIDQ2143136
Yongjie Yang, Jianxin Wang, Wenjun Li, Guozhen Rong
Publication date: 31 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.008
distance-hereditary graphs; chordal graphs; graph reconstruction; \(\{ C_{\geq 5} \}\)-free graphs; betweenness oracle
68Qxx: Theory of computing
Uses Software