Optimal fault-tolerant embedding of paths in twisted cubes

DOI10.1016/J.JPDC.2006.04.004MaRDI QIDQ866765zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jianxi Fan, Xiao-La Lin, Yi Pan, X.-H. Jia

Publication date 14 February 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.04.004

zbMATH Keywords

dilationembeddingfault tolerantparallel computing systempathtwisted cube

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited in

(32)

• Path embedding in star graphs
• Survey on path and cycle embedding in some networks
• Reliability analysis of twisted cubes
• \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
• Path and cycle fault tolerance of bubble-sort graph networks
• Constructing edge-disjoint spanning trees in twisted cubes
• Two node-disjoint paths in balanced hypercubes
• Fault-tolerant embedding of meshes/tori in twisted cubes
• One-to-one communication in twisted cubes under restricted connectivity
• Hamiltonian properties of honeycomb meshes
• A parallel algorithm for constructing independent spanning trees in twisted cubes
• A note on path embedding in crossed cubes with faulty vertices
• Fault-Tolerant Panconnectivity of Augmented Cubes AQn
• Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
• Embedding meshes into twisted-cubes
• Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
• Fault tolerant routing algorithm based on the artificial potential field model in network-on-chip
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
• Bipanconnectivity of balanced hypercubes
• Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• Independent spanning trees on twisted cubes
• The orbits of twisted cubes
• Construction algorithm of vertex-disjoint paths in circulant-based recursive networks
• Exponentiation of graphs
• Disjoint path covers of star graphs
• Embedding of tori and grids into twisted cubes
• Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Cycle embedding in star graphs with conditional edge faults
• Fault-tolerant embedding of paths in crossed cubes
• Edge-fault-tolerant node-pancyclicity of twisted cubes

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)