Enhancing fault tolerance of balanced hypercube networks by the edge partition method

DOI10.1016/j.tcs.2023.114340OpenAlexW4389988333MaRDI QIDQ6138833

Baolei Cheng, Yan Wang, Xiaoqing Liu, Jianxi Fan, Jia Yu

Publication date: 16 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114340

zbMATH Keywords

fault toleranceinterconnection networkbalanced hypercubesconditional matroidal connectivitymatroidal connectivity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding meshes into twisted-cubes
• Relationship between extra edge connectivity and component edge connectivity for regular graphs
• An efficient algorithm to construct disjoint path covers of DCell networks
• K-restricted edge connectivity for some interconnection networks
• On a kind of restricted edge connectivity of graphs
• On the extraconnectivity of graphs
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Reliability analysis of the generalized balanced hypercube
• The \(k\)-restricted edge-connectivity of the data center network DCell
• On extra connectivity and extra edge-connectivity of balanced hypercubes
• Hamiltonian cycles of balanced hypercube with more faulty edges
• Component connectivity of the hypercubes
• Symmetric Property and Reliability of Balanced Hypercube
• Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults
• Minimum partition of a matroid into independent subsets
• Matroidal connectivity and conditional matroidal connectivity of star graphs