On embedding subclasses of height-balanced trees in hypercubes
DOI10.1016/J.INS.2009.01.004zbMATH Open1171.68028OpenAlexW2086721427MaRDI QIDQ1006750FDOQ1006750
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
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
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Title not available (Why is that?)
- Node-disjoint paths in hierarchical hypercube networks
- Longest fault-free paths in hypercubes with vertex faults
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Solving efficiently the 0-1 multi-objective knapsack problem
- Title not available (Why is that?)
- Complete path embeddings in crossed cubes
- On Hamiltonian circuits and spanning trees of hypercubes
- Embedding height balanced trees and Fibonacci trees in hypercubes
- On cubes and dichotomic trees
- Title not available (Why is that?)
- Embedding meshes into crossed cubes
- Dense sets and embedding binary trees into hypercubes
- Efficient unbalanced merge-sort
- Embedding a family of disjoint 3D meshes into a crossed cube
- One-legged caterpillars span hypercubes
- General Balanced Trees
- Title not available (Why is that?)
- Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
- Parallel dictionaries using AVL trees
- Embedding the dichotomic tree into the $n$-cube
Cited In (12)
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
- Embedding a subclass of trees into hypercubes
- Evolutionary design of oriented-tree networks using Cayley-type encodings
- Embedding height balanced trees and Fibonacci trees in hypercubes
- Title not available (Why is that?)
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- Embedding meshes into twisted-cubes
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Wirelength of hypercubes into certain trees
- Optimal embeddings of generalized ladders into hypercubes
- Certain AVL subgraphs of ternary cubes
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)
