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

Authors

49

  1. JP
    Jung-Heum Park

    Catholic University of Korea, South Korea

    3 publications · 182 citations

    3

    h-index

  2. XC
    Xie-Bin Chen

    Zhangzhou Vocational and Technical College, China

    3 publications · 128 citations

    3

    h-index

  3. SP
    Shietung Peng

    University of Aizu, Japan

    2 publications · 60 citations

    2

    h-index

  4. TH
    Ten H. Lai

    The Ohio State University, United States

    1 publications · 15 citations

    1

    h-index

  5. GJ
    Gerard J. Chang

    National Yang Ming Chiao Tung University, Taiwan

    1 publications · 57 citations

    1

    h-index

1–5 of 49

Venues

  1. Information Sciences

    3 publications · 153 citations

    3

    h-index

  2. Discrete Applied Mathematics

    3 publications · 53 citations

    3

    h-index

  3. Information Processing Letters

    2 publications · 52 citations

    2

    h-index

  4. IEEE Transactions on Computers

    2 publications · 46 citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 136 citations

    2

    h-index

1–5