Fault tolerance in bubble-sort graph networks
From MaRDI portal
Publication:764377
DOI10.1016/j.tcs.2011.11.016zbMath1232.68024MaRDI QIDQ764377
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.016
68R10: Graph theory (including graph drawing) in computer science
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Link Failure Tolerance in the Arrangement Graphs, Extremal Results on Vertex and Link Residual Closeness, Subnetwork Preclusion of (n,k)-Star Networks, Conditional connectivity of recursive interconnection networks respect to embedding restriction, Estimating the subsystem reliability of bubblesort networks, Fault tolerance in \(k\)-ary \(n\)-cube networks, Conditional connectivity of star graph networks under embedding restriction, The preclusion numbers and edge preclusion numbers in a class of Cayley graphs, Reliability analysis of the cactus-based networks, The 3-good-neighbor connectivity of modified bubble-sort graphs, Generalized measures of fault tolerance for bubble sort networks, Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks, Subnetwork preclusion for bubble-sort networks, Fault tolerance in the arrangement graphs, Subnetwork reliability analysis of bubble-sort graph networks, Hyper star fault tolerance of bubble sort networks, Conditional fault tolerance in a class of Cayley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Embedding longest fault-free paths onto star graphs with more vertex faults
- A note on edge fault tolerance with respect to hypercubes
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- A study of fault tolerance in star graph
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Fault-tolerant embedding of paths in crossed cubes
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Improving bounds on link failure tolerance of the star graph
- Fault-free longest paths in star networks with conditional link faults
- How robust is the n-cube?
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- A kind of conditional fault tolerance of alternating group graphs
- Robustness of star graph network under link failure
- A group-theoretic model for symmetric interconnection networks