An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
DOI10.1142/S0129626423500032zbMATH Open1518.68274MaRDI QIDQ6135736FDOQ6135736
Authors: Mingzu Zhang, Xing Yang
Publication date: 26 August 2023
Published in: Parallel Processing Letters (Search for Journal in Brave)
Recommendations
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- On reliability of the folded hypercubes in terms of the extra edge-connectivity
- On reliability of hypercubes in terms of extra edge-connectivity
- On 2-extra edge connectivity of folded crossed cube
- scientific article; zbMATH DE number 7448597
reliabilityalgorithmedge-disjoint pathsedge fault tolerance\(h\)-extra edge-connectivityfolded-crossed hypercube
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- On the extraconnectivity of graphs
- Conditional connectivity
- The super connectivity of folded crossed cubes
- On a kind of restricted edge connectivity of graphs
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Linear wirelength of folded hypercubes
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- Vertex-transitivity on folded crossed cubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- On structural parameterizations of the edge disjoint paths problem
- The power of cut-based parameters for computing edge-disjoint paths
- \( R_3\)-connectivity of folded hypercubes
- Relation of extra edge connectivity and component edge connectivity for regular networks
- Computing vertex-disjoint paths in large graphs using MAOs
Cited In (5)
- On reliability of hypercubes in terms of extra edge-connectivity
- Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- A note of reliability analysis of \(SM\)-\(\lambda\) in folded-crossed hypercube with conditional faults
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
This page was built for publication: An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135736)