Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

DOI10.1016/j.camwa.2005.03.017zbMath1085.68108OpenAlexW2046276825MaRDI QIDQ813208

Abdel Aziz Farrag, Sen-yue Lou

Publication date: 31 January 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.03.017

zbMATH Keywords

AlgorithmsFault-toleranceCirculant graphsMeshesNetwork architectures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the chromatic number of integral circulant graphs ⋮ Developing fault-tolerant distributed loops

Cites Work

• Unnamed Item
• Designing fault-tolerant systems using automorphisms
• Tolerating faulty edges in a multi-dimensional mesh
• New algorithm for constructing fault-tolerant solutions of the circulant graph configuration
• Optimal 1-edge fault-tolerant designs for ladders.
• Designing optimal fault-tolerant star networks
• Fault-Tolerant Meshes with Small Degree
• Fault-tolerant meshes with small degree
• Edge fault tolerance in graphs

This page was built for publication: Applying fault-tolerant solutions of circulant graphs to multidimensional meshes