Enhancing fault tolerance of balanced hypercube networks by the edge partition method
From MaRDI portal
Publication:6138833
DOI10.1016/J.TCS.2023.114340OpenAlexW4389988333MaRDI QIDQ6138833FDOQ6138833
Authors: Xiaoqing Liu, Baolei Cheng, Yan Wang, Jia Yu, Jianxi Fan 
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
fault toleranceinterconnection networkbalanced hypercubesconditional matroidal connectivitymatroidal connectivity
Cites Work
- Graph theory
- On the extraconnectivity of graphs
- Fault-tolerant path embedding in folded hypercubes with both node and edge faults
- The \(k\)-restricted edge-connectivity of the data center network DCell
- Minimum partition of a matroid into independent subsets
- Symmetric Property and Reliability of Balanced Hypercube
- On a kind of restricted edge connectivity of graphs
- Component connectivity of the hypercubes
- K-restricted edge connectivity for some interconnection networks
- Title not available (Why is that?)
- Embedding meshes into twisted-cubes
- An efficient algorithm to construct disjoint path covers of DCell networks
- Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- Matroidal connectivity and conditional matroidal connectivity of star graphs
- Reliability analysis of the generalized balanced hypercube
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Hamiltonian cycles of balanced hypercube with more faulty edges
Cited In (1)
This page was built for publication: Enhancing fault tolerance of balanced hypercube networks by the edge partition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138833)
