Routing Complexity

Routing Complexity is a computational metric that quantifies the algorithmic intricacy and resource overhead involved in determining optimal paths within a network, distinguishing itself from related performance measures by focusing specifically on the inherent difficulty of the routing computation process rather than on transmission efficiency or network topology alone.

127

Publications

6.1K

Citations

276

Authors

154

Institutions

Publications per year

2017–2026

14

Authors

276

  1. CG
    Cyril Gavoille

    Université de Bordeaux, France

    7 publications · 363 citations

    7

    h-index

  2. IA
    Ittai Abraham

    Hebrew University of Jerusalem, Israel

    5 publications · 305 citations

    5

    h-index

  3. DM
    Dahlia Malkhi

    Hebrew University of Jerusalem, Israel

    5 publications · 305 citations

    5

    h-index

  4. SZ
    Shmuel Zaks

    Technion – Israel Institute of Technology, Israel

    3 publications · 54 citations

    3

    h-index

  5. TE
    Tamar Eilam

    IBM Research - Thomas J. Watson Research Center, United States

    3 publications · 54 citations

    3

    h-index

1–5 of 276

Venues

  1. 8

    h-index

  2. IEEE/ACM Transactions on Networking

    TON · 8 publications · 603 citations

    8

    h-index

  3. Computer Communications

    4 publications · 128 citations

    4

    h-index

  4. IEEE Transactions on Computers

    4 publications · 123 citations

    4

    h-index

  5. ACM Transactions on Algorithms

    TALG · 3 publications · 153 citations

    3

    h-index

1–5