Vulnerability analysis of multiprocessor system based on burnt pancake networks
From MaRDI portal
Publication:2127635
Recommendations
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks
- Component (edge) connectivity of pancake graphs
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
Cites work
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Bounds for sorting by prefix reversal
- Conditional diagnosability of alternating group networks
- Conditional diagnosability of the round matching composition networks
- Cycles in the burnt pancake graph
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Group-theoretic algorithms and graph isomorphism
- On the maximal connected component of hypercube with faulty vertices
- On the maximal connected component of hypercube with faulty vertices (II)
- The (conditional) matching preclusion for burnt pancake graphs
- The 4-component connectivity of alternating group networks
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
- The largest component of faulty star graphs
This page was built for publication: Vulnerability analysis of multiprocessor system based on burnt pancake networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127635)