Two-round probabilistic diagnosis algorithm for fault identification
From MaRDI portal
Cites work
- (t,k)-Diagnosis for Component-Composition Graphs under the MM* Model
- \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes
- Component conditional fault tolerance of hierarchical folded cubic networks
- Component connectivity of the data center network dcell
- Conditional connectivity
- Fault tolerance analysis of hierarchical folded cube
- Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity
- Minimum neighborhood in a generalized cube
- Neighbor connectivity of hypercube-based compound network
- On g-extra conditional diagnosability of hierarchical cubic networks
- On conditional fault tolerance and diagnosability of hierarchical cubic networks
- On conditional fault tolerance of hierarchical cubic networks
- On diagnosability of large fault sets in regular topology-based computer systems
- On the extraconnectivity of graphs
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Resistance distance and spanning trees of generalized multiple complete split-like graph
- The component connectivity, component diagnosability, and \(t/k\)-diagnosability of bicube networks
- THE MAXIMUM CONNECTIVITY OF A GRAPH
This page was built for publication: Two-round probabilistic diagnosis algorithm for fault identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289256)
