Interconnection Graphs

Interconnection Graphs is a formal mathematical model used in parallel computing architectures that represents the pattern of communication links between processing nodes, distinguished by its specific topological structure designed to enable efficient data routing and permutation in shuffle-exchange networks.

450

Publications

21.9K

Citations

887

Authors

404

Institutions

Publications per year

2017–2026

48

Authors

887

  1. BP
    Behrooz Parhami

    University of California, Santa Barbara, United States

    8 publications · 194 citations

    8

    h-index

  2. SW
    Shiying Wang

    Henan Normal University, China

    8 publications · 151 citations

    8

    h-index

  3. EC
    Eddie Cheng

    Oakland University, United States

    8 publications · 278 citations

    8

    h-index

  4. SH
    Sun‐Yuan Hsieh

    National Cheng Kung University, Taiwan

    7 publications · 235 citations

    7

    h-index

  5. WX
    Wenjun Xiao

    Hunan Agricultural University, China

    6 publications · 154 citations

    6

    h-index

1–5 of 887

Venues

  1. IEEE Transactions on Computers

    45 publications · 6.8K citations

    29

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 30 publications · 1.7K citations

    22

    h-index

  3. Networks

    19 publications · 839 citations

    16

    h-index

  4. Journal of Parallel and Distributed Computing

    15 publications · 553 citations

    12

    h-index

  5. Information Processing Letters

    10 publications · 224 citations

    10

    h-index

1–5