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 11 items.
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Efficient provably-secure hierarchical key assignment schemes (Q719310) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- Reconstructing edge-disjoint paths. (Q1413914) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
