A new algorithm for building alphabetic minimax trees (Q3400581)
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 5666791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for building alphabetic minimax trees |
scientific article; zbMATH DE number 5666791 |
Statements
A New Algorithm for Building Alphabetic Minimax Trees (English)
0 references
5 February 2010
0 references
data structures
0 references
alphabetic minimax trees
0 references
0.873542308807373
0 references
0.8707391619682312
0 references
0.8558804988861084
0 references
0.8544085025787354
0 references
