Edge Routing

Edge Routing is a method in graph drawing that determines the geometric paths connecting nodes in a node-link diagram, distinguished by its focus on optimizing visual clarity, minimizing crossings, and adhering to aesthetic criteria while preserving the underlying graph structure.

24

Publications

1.1K

Citations

68

Authors

42

Institutions

Publications per year

2017–2026

2

Authors

68

  1. LN
    Lev Nachmanson

    Microsoft (United States), United States

    2 publications · 29 citations

    2

    h-index

  2. SB
    Sergey Bereg

    The University of Texas at Dallas, United States

    2 publications · 29 citations

    2

    h-index

  3. SP
    Sergey Pupyrev

    University of Arizona, United States

    2 publications · 29 citations

    2

    h-index

  4. RG
    Robert Garfinkel

    University of Connecticut, United States

    2 publications · 50 citations

    2

    h-index

  5. DS
    Dominique Sotteau

    Université Paris-Sud, France

    2 publications · 45 citations

    2

    h-index

1–5 of 68

Venues

  1. Networks

    3 publications · 69 citations

    3

    h-index

  2. IEEE/ACM Transactions on Networking

    TON · 1 publications · 48 citations

    1

    h-index

  3. ETRI Journal

    1 publications · 16 citations

    1

    h-index

  4. Information and Computation

    1 publications · 11 citations

    1

    h-index

  5. Computational Geometry

    1 publications · 19 citations

    1

    h-index

1–5