Embedding height balanced trees and Fibonacci trees in hypercubes
type: Item
instance of: scholarly article
title: Embedding height balanced trees and Fibonacci trees in hypercubes
zbMATH Open document ID: 1193.68187
author: Indhumathi Raman
author: S. A. Choudum
published in: Journal of Applied Mathematics and Computing
publication date: 2009-10-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5620247
zbMATH Keywords: interconnection network
zbMATH Keywords: hypercube
zbMATH Keywords: height-balanced tree
zbMATH Keywords: Fibonacci tree
zbMATH Keywords: embedding
MaRDI profile type: Publication
full work available at URL: s12190-008-0155-z
OpenAlex ID: W2059367745
cites work: General Balanced Trees
cites work: A unified approach to the parallel construction of search trees
cites work: Dense sets and embedding binary trees into hypercubes
cites work: Concurrent Search and Insertion in AVL Trees
cites work: Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
cites work: On Hamiltonian circuits and spanning trees of hypercubes
cites work: Q3972004
cites work: Performance of height-balanced trees
cites work: On median nature and enumerative properties of Fibonacci-like cubes
cites work: Q4057549
cites work: Q4002466
cites work: Generalized fibonacci cubes are mostly hamiltonian
cites work: Parallel dictionaries using AVL trees
cites work: Parallel tree-contraction and Fibonacci numbers
cites work: Q4707226
cites work: Fast recognition of Fibonacci cubes
DOI: 10.1007/S12190-008-0155-Z
description: scientific article; zbMATH DE number 5620247