Counting difficult tree pairs with respect to the rotation distance problem (Q4995296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7362658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting difficult tree pairs with respect to the rotation distance problem |
scientific article; zbMATH DE number 7362658 |
Statements
23 June 2021
0 references
rooted binary trees
0 references
approximation algorithms
0 references
0.8764134049415588
0 references
0.8305009603500366
0 references
0.8261280655860901
0 references
0.8057519793510437
0 references
