Fault-tolerant routing in circulant networks and cycle prefix networks
From MaRDI portal
Publication:1305199
DOI10.1007/BF01608486zbMath0930.05035MaRDI QIDQ1305199
Feng Cao, D. Frank Hsu, Sheng-Chyang Liaw, Gerard Jennhwa Chang
Publication date: 11 November 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
Related Items (13)
Fault diameter of Cartesian product graphs ⋮ Edge, vertex and mixed fault diameters ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Fault-diameter of Cartesian graph bundles ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The fault-diameter of Cartesian products ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Which Faber-Moore-Chen digraphs are Cayley digraphs? ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Unnamed Item ⋮ Rabin numbers of Butterfly networks ⋮ Topological properties on the diameters of the integer simplex
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault diameter of interconnection networks
- On the fault-diameter of the star graph
- Generalized diameters and Rabin numbers of networks
- Rabin numbers of Butterfly networks
- Wide diameters of butterfly networks
- Determining the Hamilton-connectedness of certain vertex-transitive graphs
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- On the diameter vulnerability of Kautz digraphs
- On the connectivity of Cayley digraphs
- Cycle prefix digraphs for symmetric interconnection networks
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
This page was built for publication: Fault-tolerant routing in circulant networks and cycle prefix networks
