Set Orderings Requiring Costliest Alphabetic Binary Trees (Q3964022)
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: Set Orderings Requiring Costliest Alphabetic Binary Trees |
scientific article; zbMATH DE number 3786141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set Orderings Requiring Costliest Alphabetic Binary Trees |
scientific article; zbMATH DE number 3786141 |
Statements
Set Orderings Requiring Costliest Alphabetic Binary Trees (English)
0 references
1981
0 references
sawtooth order
0 references
upper bound on the cost of alphabetic binary trees
0 references
