Optimal fault-tolerant embedding of paths in twisted cubes
From MaRDI portal
(Redirected from Publication:866765)
Cited in
(27)- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
- One-to-one communication in twisted cubes under restricted connectivity
- Independent spanning trees on twisted cubes
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
- Two node-disjoint paths in balanced hypercubes
- Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
- Survey on path and cycle embedding in some networks
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- Bipanconnectivity of balanced hypercubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Cycle embedding in star graphs with conditional edge faults
- Path embedding in star graphs
- Fault tolerant routing algorithm based on the artificial potential field model in network-on-chip
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
- Fault-tolerant embedding of paths in crossed cubes
- Path and cycle fault tolerance of bubble-sort graph networks
- Panconnectivity and edge-pancyclicity of multidimensional torus networks
- Fault-tolerant embedding of meshes/tori in twisted cubes
- Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
- Hamiltonian properties of honeycomb meshes
- Embedding meshes into twisted-cubes
- Reliability analysis of twisted cubes
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- Embedding of tori and grids into twisted cubes
- A note on path embedding in crossed cubes with faulty vertices
- Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
This page was built for publication: Optimal fault-tolerant embedding of paths in twisted cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866765)