Embedding meshes/tori in faulty crossed cubes
From MaRDI portal
Publication:765478
DOI10.1016/J.IPL.2010.04.007zbMATH Open1234.68021OpenAlexW2057944208MaRDI QIDQ765478FDOQ765478
Qiang Dong, Xiaofan Yang, Yuan Yan Tang
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.007
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Mathematical problems of computer architecture (68M07)
Cites Work
- Title not available (Why is that?)
- Fault-tolerant cycle-embedding of crossed cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Paths in Möbius cubes and crossed cubes
- Complete path embeddings in crossed cubes
- Embedding meshes into crossed cubes
- Fault-tolerant embedding of paths in crossed cubes
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Embedding a family of disjoint 3D meshes into a crossed cube
- Constructing the nearly shortest path in crossed cubes
- Conditional fault diameter of crossed cubes
Cited In (20)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
- One-to-one disjoint path covers on alternating group graphs
- Embedding meshes in hypercubes with edge faults
- A linear time algorithm for embedding hypercube into cylinder and torus
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Embedding Wheel - like Networks
- Embedding of the folded hypercubes into tori
- Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
- Multiple regular graph embeddings into a hypercube with unbounded expansion
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- Embedding of hypercubes into sibling trees
- Bothway embedding of circulant network into grid
- Embeddings of circulant networks
- Embedding of recursive circulants into certain necklace graphs
- Super spanning connectivity on WK-recursive networks
- Wirelength of embedding complete multipartite graphs into certain graphs
- Embedding a family of meshes into twisted cubes
- Construction of the mesh and the torus tolerating a large number of faults
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)
