Complete binary trees embeddings in Möbius cubes
From MaRDI portal
Publication:896018
DOI10.1016/j.jcss.2015.09.004zbMath1346.68026OpenAlexW2191831997WikidataQ60402104 ScholiaQ60402104MaRDI QIDQ896018
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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items (2)
How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
Cites Work
- Geodesic pancyclicity of twisted cubes
- Optimal distortion embedding of complete binary trees into lines
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- The twisted-cube connected networks
- Expansion of layouts of complete binary trees into grids
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
- Embedding trees in recursive circulants
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Congestion-free, dilation-2 embedding of complete binary trees into star graphs
- On cubes and dichotomic trees
- Embedding graphs onto the Supercube
- The Mobius cubes
- Embedding binary trees into crossed cubes
- Complete binary trees in folded and enhanced cubes
- Area-efficient VLSI layouts for binary hypercubes
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Embedding Meshes and Tori on Double-Loop Networks of the Same Size
- Embedding complete binary trees into butterfly networks
- Independent spanning trees in crossed cubes
This page was built for publication: Complete binary trees embeddings in Möbius cubes
