An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
DOI10.1142/s0129626423500032zbMath1518.68274MaRDI QIDQ6135736
Xing Yang, Unnamed Author, Mingzu Zhang, Unnamed Author
Publication date: 26 August 2023
Published in: Parallel Processing Letters (Search for Journal in Brave)
algorithmreliabilityedge-disjoint pathsedge fault tolerance\(h\)-extra edge-connectivityfolded-crossed hypercube
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (1)
Cites Work
- 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
- On a kind of restricted edge connectivity of graphs
- The super connectivity of folded crossed cubes
- Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
- On the extraconnectivity of graphs
- On structural parameterizations of the edge disjoint paths problem
- \( R_3\)-connectivity of folded hypercubes
- Computing vertex-disjoint paths in large graphs using MAOs
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Vertex-transitivity on folded crossed cubes
- The power of cut-based parameters for computing edge-disjoint paths
- Conditional connectivity
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
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
