Embedding meshes/tori in faulty crossed cubes
From MaRDI portal
(Redirected from Publication:765478)
Recommendations
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Complete path embeddings in crossed cubes
- Conditional fault diameter of crossed cubes
- Constructing the nearly shortest path in crossed cubes
- Embedding a family of disjoint 3D meshes into a crossed cube
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Embedding meshes into crossed cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Fault-tolerant cycle-embedding of crossed cubes
- Fault-tolerant embedding of paths in crossed cubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Paths in Möbius cubes and crossed cubes
Cited in
(26)- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Bothway embedding of circulant network into grid
- Embedding of recursive circulants into certain necklace graphs
- Embedding a family of meshes into twisted cubes
- Super spanning connectivity on WK-recursive networks
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding a mesh of trees in the crossed cube
- Embedding meshes into crossed cubes
- Matching preclusion and conditional matching preclusion for crossed cubes
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- Multiple regular graph embeddings into a hypercube with unbounded expansion
- Construction of the mesh and the torus tolerating a large number of faults
- Embeddings of circulant networks
- Wirelength of embedding complete multipartite graphs into certain graphs
- Fault-tolerant embedding of meshes/tori in twisted cubes
- Embedding of the folded hypercubes into tori
- Embedding meshes in hypercubes with edge faults
- Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
- Embedding a family of disjoint 3D meshes into a crossed cube
- One-to-one disjoint path covers on alternating group graphs
- A linear time algorithm for embedding hypercube into cylinder and torus
- Embedding of hypercubes into sibling trees
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
- Embedding Wheel - like Networks
This page was built for publication: Embedding meshes/tori in faulty crossed cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765478)
