Embedding a long fault-free cycle in a crossed cube with more faulty nodes
From MaRDI portal
Publication:656607
DOI10.1016/J.IPL.2010.04.014zbMATH Open1229.68007OpenAlexW1970139172MaRDI QIDQ656607FDOQ656607
Publication date: 18 January 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.014
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
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
- 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
Cited In (3)
This page was built for publication: Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656607)