N-cube Networks

n-Cube Networks is a formal mathematical model of a multidimensional interconnection network in which nodes correspond to binary n-tuples and edges connect nodes that differ in exactly one bit position, forming a recursive structure based on the Cartesian product of lower-dimensional cubes.

150

Publications

8.8K

Citations

250

Authors

123

Institutions

Publications per year

2017–2026

21

Authors

250

  1. SH
    Sun‐Yuan Hsieh

    National Cheng Kung University, Taiwan

    8 publications · 498 citations

    8

    h-index

  2. JF
    Jianxi Fan

    Soochow University, China

    8 publications · 352 citations

    8

    h-index

  3. MO
    M. Ould‐Khaoua

    University of Glasgow, United Kingdom

    6 publications · 127 citations

    6

    h-index

  4. SW
    Shiying Wang

    Henan Normal University, China

    6 publications · 146 citations

    6

    h-index

  5. DK
    Dhabaleswar K. Panda

    The Ohio State University, United States

    5 publications · 79 citations

    5

    h-index

1–5 of 250

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 21 publications · 1.2K citations

    16

    h-index

  2. IEEE Transactions on Computers

    11 publications · 3.2K citations

    11

    h-index

  3. Theoretical Computer Science

    9 publications · 347 citations

    9

    h-index

  4. Information Processing Letters

    8 publications · 198 citations

    8

    h-index

  5. Information Sciences

    6 publications · 254 citations

    6

    h-index

1–5