On embedding subclasses of height-balanced trees in hypercubes

DOI10.1016/j.ins.2009.01.004zbMath1171.68028MaRDI QIDQ1006750

Raman Indhumathi, Sheshayya A. Choudum

Publication date: 25 March 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.01.004

zbMATH Keywords

hypercube; embedding; dilation; parallel algorithm; interconnection network; height-balanced tree

Mathematics Subject Classification ID

05C05: Trees

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

Related Items

Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes, An optimal time algorithm for minimum linear arrangement of chord graphs, Embedding a subclass of trees into hypercubes, Embedding meshes into twisted-cubes, Evolutionary design of oriented-tree networks using Cayley-type encodings, Wirelength of hypercubes into certain trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Longest fault-free paths in hypercubes with vertex faults
• Dense sets and embedding binary trees into hypercubes
• Solving efficiently the 0-1 multi-objective knapsack problem
• Embedding a family of disjoint 3D meshes into a crossed cube
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Parallel dictionaries using AVL trees
• Embedding meshes into crossed cubes
• Node-disjoint paths in hierarchical hypercube networks
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Efficient unbalanced merge-sort
• Complete path embeddings in crossed cubes
• One-legged caterpillars span hypercubes
• General Balanced Trees
• Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees