Fault Tolerance on Star Graphs
From MaRDI portal
Publication:4358516
Recommendations
Cited in
(21)- A study of fault tolerance in star graph
- The restricted h-connectivity of the data center network DCell
- Fault-tolerance of (n, k)-star networks
- The 1-good neighbor connectivity of unidirectional star graph networks
- Distributed Computing – IWDC 2005
- Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern
- The largest component of faulty star graphs
- scientific article; zbMATH DE number 1471732 (Why is no real title available?)
- Conditional fault tolerance of arrangement graphs
- Cluster fault-tolerant routing in star graphs
- Improving bounds on link failure tolerance of the star graph
- An adaptive heuristic algorithm with the probabilistic safety vector for fault-tolerant routing on the \((n,k)\)-star graph
- Conditional connectivity of star graph networks under embedding restriction
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- \( R_3\)-connectivity of folded hypercubes
- Distributed Computing - IWDC 2004
- scientific article; zbMATH DE number 913541 (Why is no real title available?)
- Conditional fault-tolerant routing of \((n,k)\)-star graphs
- \(h\)-restricted connectivity of locally twisted cubes
- The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
This page was built for publication: Fault Tolerance on Star Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358516)
