Pages that link to "Item:Q4349698"
From MaRDI portal
The following pages link to A Data Structure for Dynamically Maintaining Rooted Trees (Q4349698):
Displaying 13 items.
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Self-adjusting top trees (Q2921745) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Data structures for mergeable trees (Q3188996) (← links)
- (Q3761707) (← links)
- Topology B-trees and their applications (Q5057450) (← links)
- A consistent semantics of self-adjusting computation (Q5398334) (← links)
- Algorithms and Computation (Q5712166) (← links)
- Incremental dead state detection in logarithmic time (Q6535537) (← links)