Succinct and I/O efficient data structures for traversal in trees (Q2429347)
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 6028477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct and I/O efficient data structures for traversal in trees |
scientific article; zbMATH DE number 6028477 |
Statements
Succinct and I/O efficient data structures for traversal in trees (English)
0 references
26 April 2012
0 references
succinct data structures
0 references
I/O efficient data structures
0 references
data structures
0 references
trees
0 references
path traversal
0 references
0.9873628616333008
0 references
0.7860302329063416
0 references
0.785943865776062
0 references
0.7859436869621277
0 references
0.7778607606887817
0 references
