An efficient upper bound of the rotation distance of binary trees (Q1607028)
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 1771744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient upper bound of the rotation distance of binary trees |
scientific article; zbMATH DE number 1771744 |
Statements
An efficient upper bound of the rotation distance of binary trees (English)
0 references
25 July 2002
0 references
polynomial time algorithm
0 references
0.8805443048477173
0 references
0.8594998121261597
0 references
0.858519971370697
0 references
0.8379440903663635
0 references
