Succinct and I/O efficient data structures for traversal in trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1303548 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- An external memory data structure for shortest path queries
- Balanced parentheses strike back
- Blocking for external graph searching
- Cache-oblivious string dictionaries
- How to Pack Trees
- Representing trees of higher degree
- Succinct and I/O Efficient Data Structures for Traversal in Trees
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct representation of balanced parentheses and static trees
- Worst-case optimal tree layout in external memory
Cited in
(6)- How to pack directed acyclic graphs into small blocks
- Vectorization of tree traversals
- Succinct and I/O Efficient Data Structures for Traversal in Trees
- Succinct Data Structures for Path Queries
- Succinct data structure for dynamic trees with faster queries
- I/O-efficient path traversal in succinct planar graphs
This page was built for publication: Succinct and I/O efficient data structures for traversal in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429347)
