Hypercube Network Disjoint Paths
Hypercube Network Disjoint Paths is a formal construct in parallel computing architectures that denotes a set of node-disjoint or edge-disjoint communication pathways within a hypercube network, ensuring fault-tolerant and congestion-free data transmission by leveraging the inherent topological redundancy of the hypercube structure.
25
Publications
757
Citations
49
Authors
38
Institutions
Publications per year
2017–2026
0
Parents
25
Many-to-many disjoint paths in faulty hypercubes
Xie-Bin Chen · Information Sciences · 2009 · 65 citations
Node-disjoint paths in hierarchical hypercube networks
Ruei-Yu Wu, Gen-Huey Chen, Yu‐Liang Kuo et al. · Information Sciences · 2007 · 57 citations
1–5 of 25
49
3
h-index
3
h-index
2
h-index
1
h-index
1
h-index
1–5 of 49
38
Catholic University of Korea
Seoul, South Korea
3 h-index
3 publications
182 citations
Zhangzhou Vocational and Technical College
Zhangzhou, China
3 h-index
3 publications
128 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
81 citations
University of California, Santa Barbara
Santa Barbara, United States
2 h-index
3 publications
36 citations

University of Aizu
Fukushima, Japan
1 h-index
2 publications
84 citations
Chinese University of Hong Kong, Shenzhen
Shenzhen, China
1 h-index
1 publications
20 citations
National Taiwan University of Science and Technology
Taipei, Taiwan
1 h-index
1 publications
16 citations

Tamkang University
Taipei, Taiwan
1 h-index
2 publications
24 citations
1–8 of 38
3 publications · 153 citations
3
h-index
3 publications · 53 citations
3
h-index
2 publications · 52 citations
2
h-index
2 publications · 46 citations
2
h-index
TPDS · 2 publications · 136 citations
2
h-index
1–5