Vulnerability analysis of multiprocessor system based on burnt pancake networks

DOI10.1016/J.DAM.2022.03.010OpenAlexW4221132792MaRDI QIDQ2127635FDOQ2127635

Jiafei Liu, Shuming Zhou, Gaolin Chen, Hong Zhang

Publication date: 20 April 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.03.010

zbMATH Keywords

fault tolerancemultiprocessor systemsburnt pancake networkmaximal component

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computer system organization (68Mxx)

Cites Work

• The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
• Conditional diagnosability of alternating group networks
• Group-theoretic algorithms and graph isomorphism
• The (conditional) matching preclusion for burnt pancake graphs
• Bounds for sorting by prefix reversal
• On the maximal connected component of hypercube with faulty vertices (II)
• On the maximal connected component of hypercube with faulty vertices
• Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
• Conditional diagnosability of the round matching composition networks
• The 4-component connectivity of alternating group networks
• Fault tolerance and diagnosability of burnt pancake networks under the comparison model
• Cycles in the burnt pancake graph
• 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)