A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A divide-and-conquer approach for reconstruction of \C_ 5\-free graphs via betweenness queries |
scientific article; zbMATH DE number 7533874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries |
scientific article; zbMATH DE number 7533874 |
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
0.8068495392799377
0 references
0.762242317199707
0 references
0.7417697906494141
0 references
0.7390543818473816
0 references
