Complete binary trees embeddings in Möbius cubes

DOI10.1016/J.JCSS.2015.09.004zbMATH Open1346.68026OpenAlexW2191831997WikidataQ60402104 ScholiaQ60402104MaRDI QIDQ896018FDOQ896018

Authors N. E. Zubov

Publication date 11 December 2015

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2015.09.004

zbMATH Keywords

dilationexpansioncongestionloadcomplete binary treeinterconnection architectureMöbius cube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Embedding of meshes in Möbius cubes
• Complete binary trees in folded and enhanced cubes
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• Optimal dynamic embeddings of complete binary trees into hypercubes
• Embedding complete binary trees into hypercubes

Cites work

• Area-efficient VLSI layouts for binary hypercubes
• Catalan structures and dynamic programming in \(H\)-minor-free graphs
• Complete binary trees in folded and enhanced cubes
• Congestion-free, dilation-2 embedding of complete binary trees into star graphs
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Embedding Meshes and Tori on Double-Loop Networks of the Same Size
• Embedding binary trees into crossed cubes
• Embedding complete binary trees into butterfly networks
• Embedding graphs onto the Supercube
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Embedding trees in recursive circulants
• Expansion of layouts of complete binary trees into grids
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Geodesic pancyclicity of twisted cubes
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• Independent spanning trees in crossed cubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• On cubes and dichotomic trees
• On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
• Optimal distortion embedding of complete binary trees into lines
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The Mobius cubes
• The twisted-cube connected networks

Cited in

(4)

• Embedding binary trees into crossed cubes
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• Möbius coinvariants and bipartite edge-rooted forests

This page was built for publication: Complete binary trees embeddings in Möbius cubes

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