Pages that link to "Item:Q2441590"
From MaRDI portal
The following pages link to A uniform paradigm to succinctly encode various families of trees (Q2441590):
Displaying 20 items.
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Encoding nearest larger values (Q1698712) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- Path queries on functions (Q1740690) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Encoding Nearest Larger Values (Q2942276) (← links)
- Encoding range minima and range top-2 queries (Q2955625) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- (Q5092430) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
- (Q6065424) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs (Q6610090) (← links)
