Succinct data structures for nearest colored node in a tree (Q1705642)
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: Succinct data structures for nearest colored node in a tree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct data structures for nearest colored node in a tree |
scientific article |
Statements
Succinct data structures for nearest colored node in a tree (English)
0 references
16 March 2018
0 references
succinct data structures
0 references
labeled trees
0 references
colored trees
0 references
0 references
0.8691078424453735
0 references
0.8691077828407288
0 references
0.7734372019767761
0 references
0.7493026256561279
0 references
0.7311393618583679
0 references
