Hypercube Network Diameter

Hypercube Network Diameter is the longest shortest path length between any two nodes in an n-dimensional hypercube network, serving as a metric that quantifies the maximum communication delay in the network.

66

Publications

3.2K

Citations

131

Authors

91

Institutions

Publications per year

2017–2026

4

Authors

131

  1. CL
    Cheng‐Kuan Lin

    Soochow University, China

    4 publications · 122 citations

    4

    h-index

  2. JJ
    Jimmy J.M. Tan

    National Yang Ming Chiao Tung University, Taiwan

    4 publications · 96 citations

    4

    h-index

  3. JF
    Jianxi Fan

    Soochow University, China

    4 publications · 313 citations

    4

    h-index

  4. LH
    Lih‐Hsing Hsu

    National Yang Ming Chiao Tung University, Taiwan

    3 publications · 108 citations

    3

    h-index

  5. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    2 publications · 32 citations

    3

    h-index

1–5 of 131

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 10 publications · 614 citations

    10

    h-index

  2. IEEE Transactions on Computers

    9 publications · 882 citations

    9

    h-index

  3. Information Processing Letters

    5 publications · 175 citations

    5

    h-index

  4. Networks

    3 publications · 218 citations

    3

    h-index

  5. Discrete Applied Mathematics

    3 publications · 112 citations

    3

    h-index

1–5