Embedding of meshes in Möbius cubes
From MaRDI portal
Publication:935162
DOI10.1016/J.TCS.2008.04.023zbMath1146.68017OpenAlexW2092490723MaRDI QIDQ935162
Publication date: 31 July 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.023
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ Embedding Wheel - like Networks ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Bothway embedding of circulant network into grid ⋮ Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ A novel algorithm to embed a multi-dimensional torus into a locally twisted cube ⋮ Embedding meshes into twisted-cubes ⋮ Embedding of tori and grids into twisted cubes ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ The panpositionable panconnectedness of augmented cubes ⋮ Embedding meshes into locally twisted cubes ⋮ On the bipanpositionable bipanconnectedness of hypercubes
Cites Work
- Unnamed Item
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
- Linear array and ring embeddings in conditional faulty hypercubes
- Embedding meshes into crossed cubes
- Embedding graphs onto the Supercube
- The Mobius cubes
- Embedding binary trees into crossed cubes
- Embedding of cycles in arrangement graphs
- Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
This page was built for publication: Embedding of meshes in Möbius cubes