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

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

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)

Cites Work

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

Cited In (4)

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

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)