Computing on a free tree via complexity-preserving mappings
From MaRDI portal
(Redirected from Publication:1098314)
Recommendations
Cites work
- [article; zbMATH DE number 3473265 (Why is no real title available?)]
- [article; zbMATH DE number 3511563 (Why is no real title available?)]
- A data structure for dynamic trees
- A new approach to rectangle intersections
- A unifying look at data structures
- Applications of Path Compression on Balanced Trees
- Efficiency of a Good But Not Linear Set Union Algorithm
- Fast Algorithms for Finding Nearest Common Ancestors
- Fractional cascading. I: A data structuring technique
- Multidimensional divide-and-conquer
- New Data Structures for Orthogonal Range Queries
- Priority Search Trees
- Self-adjusting binary search trees
Cited in
(29)- Dynamic algorithms for graphs of bounded treewidth
- Shortcutting Planar Digraphs
- Simple parallel algorithms for dynamic range products
- Shortest path queries in digraphs of small treewidth
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
- scientific article; zbMATH DE number 1696443 (Why is no real title available?)
- scientific article; zbMATH DE number 7561636 (Why is no real title available?)
- Visibility and intersection problems in plane geometry
- Tree path majority data structures
- Dynamic tree shortcut with constant degree
- A hierarchy of lower bounds for sublinear additive spanners
- Trees and linked lists with variable ordering relations (RTR structures)
- Faster algorithms for shortest path and network flow based on graph decomposition
- Steiner transitive-closure spanners of low-dimensional posets
- Parallel preprocessing for path queries without concurrent reading.
- Shortest beer path queries in outerplanar graphs
- Transitive-closure spanners: a survey
- Building Cartesian trees from free trees with \(k\) leaves
- Succinct indices for path minimum, with applications
- Small hop-diameter sparse spanners for doubling metrics
- Efficient provably-secure hierarchical key assignment schemes
- Reconstructing edge-disjoint paths.
- scientific article; zbMATH DE number 3845635 (Why is no real title available?)
- Dynamic path queries in linear space
- Minimum cuts and sparsification in hypergraphs
- Succinct representations of weighted trees supporting path queries
- Shortcutting directed and undirected networks with a degree constraint
- Finding level-ancestors in trees
- Reconstructing edge-disjoint paths faster
This page was built for publication: Computing on a free tree via complexity-preserving mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098314)
