Pages that link to "Item:Q1098314"
From MaRDI portal
The following pages link to Computing on a free tree via complexity-preserving mappings (Q1098314):
Displayed 26 items.
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Efficient provably-secure hierarchical key assignment schemes (Q719310) (← links)
- Tree path majority data structures (Q784481) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- Reconstructing edge-disjoint paths. (Q1413914) (← links)
- Reconstructing edge-disjoint paths faster (Q1785736) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree (Q2258072) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- Dynamic Tree Shortcut with Constant Degree (Q3196404) (← links)
- Simple Parallel Algorithms for Dynamic Range Products (Q3464484) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- Dynamic algorithms for graphs of bounded treewidth (Q4571961) (← links)
- Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- (Q5092347) (← links)
- Faster algorithms for shortest path and network flow based on graph decomposition (Q5240369) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- Shortest beer path queries in outerplanar graphs (Q6103523) (← links)