Edge Length Minimization

Edge Length Minimization is a graph layout optimization objective that seeks to reduce the total or average Euclidean distance between connected vertices in a two-dimensional or three-dimensional embedding, thereby enhancing visual clarity and structural compactness of the graph representation.

93

Publications

4.3K

Citations

195

Authors

118

Institutions

Publications per year

2017–2026

17

Variants

Edge Length Minimisation

Authors

195

  1. BA
    Behrooz Alizadeh

    Sahand University of Technology, Iran

    4 publications · 175 citations

    4

    h-index

  2. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    4 publications · 100 citations

    4

    h-index

  3. RE
    Rainer E. Burkard

    Graz University of Technology, Austria

    3 publications · 158 citations

    3

    h-index

  4. FT
    Frank Thomson Leighton

    Massachusetts Institute of Technology, United States

    3 publications · 337 citations

    3

    h-index

  5. JF
    James F. O’Brien

    University of California, Berkeley, United States

    3 publications · 61 citations

    3

    h-index

1–5 of 195

Venues

  1. Discrete Applied Mathematics

    4 publications · 212 citations

    4

    h-index

  2. SIAM Journal on Computing

    3 publications · 121 citations

    3

    h-index

  3. Discrete Mathematics

    3 publications · 53 citations

    3

    h-index

  4. Networks

    3 publications · 164 citations

    3

    h-index

  5. Journal of Graph Algorithms and Applications

    JGAA · 3 publications · 69 citations

    3

    h-index

1–5