Pages that link to "Item:Q4571959"
From MaRDI portal
The following pages link to Minimizing diameters of dynamic trees (Q4571959):
Displaying 12 items.
- Longest common extensions in trees (Q294947) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Almost optimal dynamic 2-3 trees (Q1084868) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Minimizing the continuous diameter when augmenting a tree with a shortcut (Q2405291) (← links)
- Gapped indexing for consecutive occurrences (Q2696274) (← links)
- Tight Bounds for Top Tree Compression (Q5150922) (← links)
- Dynamic low-stretch trees via dynamic low-diameter decompositions (Q5212779) (← links)
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay (Q6124426) (← links)