A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries |
scientific article |
Statements
A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (English)
0 references
31 May 2022
0 references
graph reconstruction
0 references
betweenness oracle
0 references
\(\{ C_{\geq 5} \}\)-free graphs
0 references
chordal graphs
0 references
distance-hereditary graphs
0 references
