Embedding height balanced trees and Fibonacci trees in hypercubes
From MaRDI portal
Recommendations
- On embedding subclasses of height-balanced trees in hypercubes
- Embedding certain height-balanced trees and complete p^m-ary trees into hypercubes
- Embedding complete binary trees into hypercubes
- Embedding the complete tree in the hypercube
- On embedding of certain recursive trees and stars into hypercube
Cites work
- scientific article; zbMATH DE number 15360 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1925552 (Why is no real title available?)
- A unified approach to the parallel construction of search trees
- Concurrent Search and Insertion in AVL Trees
- Dense sets and embedding binary trees into hypercubes
- Fast recognition of Fibonacci cubes
- General Balanced Trees
- Generalized fibonacci cubes are mostly hamiltonian
- On Hamiltonian circuits and spanning trees of hypercubes
- On median nature and enumerative properties of Fibonacci-like cubes
- Parallel dictionaries using AVL trees
- Parallel tree-contraction and Fibonacci numbers
- Performance of height-balanced trees
- Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
Cited in
(5)
This page was built for publication: Embedding height balanced trees and Fibonacci trees in hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031992)