On embedding subclasses of height-balanced trees in hypercubes

DOI10.1016/J.INS.2009.01.004MaRDI QIDQ1006750zbMATH OpenOpenAlexFDO

Authors S. A. Choudum, Raman Indhumathi

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

dilationembeddingheight-balanced treehypercubeinterconnection networkparallel algorithm

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Embedding certain height-balanced trees and complete p^m-ary trees into hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• On embedding of certain recursive trees and stars into hypercube
• Embedding complete binary trees into hypercubes
• scientific article; zbMATH DE number 4064517

Cites work

• Complete path embeddings in crossed cubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Dense sets and embedding binary trees into hypercubes
• Efficient unbalanced merge-sort
• Embedding a family of disjoint 3D meshes into a crossed cube
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding meshes into crossed cubes
• Embedding the dichotomic tree into the n-cube
• General Balanced Trees
• 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?)
• scientific article; zbMATH DE number 4185639 (Why is no real title available?)
• Longest fault-free paths in hypercubes with vertex faults
• Node-disjoint paths in hierarchical hypercube networks
• On cubes and dichotomic trees
• On Hamiltonian circuits and spanning trees of hypercubes
• One-legged caterpillars span hypercubes
• Parallel dictionaries using AVL trees
• Solving efficiently the 0-1 multi-objective knapsack problem
• Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees

Cited in

(12)

• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• Embedding certain height-balanced trees and complete p^m-ary trees into hypercubes
• An optimal time algorithm for minimum linear arrangement of chord graphs
• scientific article; zbMATH DE number 7250384 (Why is no real title available?)
• Certain AVL subgraphs of ternary cubes
• Embedding a subclass of trees into hypercubes
• Embedding meshes into twisted-cubes
• Optimal embeddings of generalized ladders into hypercubes
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• Evolutionary design of oriented-tree networks using Cayley-type encodings

This page was built for publication: On embedding subclasses of height-balanced trees in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006750)