Embedding height balanced trees and Fibonacci trees in hypercubes

DOI10.1007/s12190-008-0155-zzbMath1193.68187OpenAlexW2059367745MaRDI QIDQ1031992

Indhumathi Raman, Sheshayya A. Choudum

Publication date: 23 October 2009

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0155-z

zbMATH Keywords

hypercubeembeddinginterconnection networkFibonacci treeheight-balanced tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05)

Related Items (5)

Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes ⋮ Embedding a subclass of trees into hypercubes ⋮ EVOLUTIONARY HIERARCHICAL CREDIBILITY ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ A note on the cubical dimension of new classes of binary trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel tree-contraction and Fibonacci numbers
• Dense sets and embedding binary trees into hypercubes
• Parallel dictionaries using AVL trees
• A unified approach to the parallel construction of search trees
• Fast recognition of Fibonacci cubes
• On median nature and enumerative properties of Fibonacci-like cubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Concurrent Search and Insertion in AVL Trees
• Performance of height-balanced trees
• General Balanced Trees
• Generalized fibonacci cubes are mostly hamiltonian
• Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees

This page was built for publication: Embedding height balanced trees and Fibonacci trees in hypercubes