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
Parents
93
Minimal Mutation Trees of Sequences
David Sankoff · SIAM Journal on Applied Mathematics · 1975 · 598 citations
The Steiner problem with edge lengths 1 and 2
Marshall Bern, Paul E. Plassmann · Information Processing Letters · 1989 · 378 citations
New lower bound techniques for VLSI
Frank Thomson Leighton · Theory of Computing Systems · 1984 · 179 citations
New lower bound techniques for VLSI
Frank Thomson Leighton · 1981 · 127 citations
1–5 of 93
195
4
h-index
4
h-index
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 337 citations
3
h-index
3
h-index
1–5 of 195
118
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
8 publications
552 citations
Graz University of Technology
Graz, Austria
5 h-index
7 publications
319 citations

Sahand University of Technology
Tabriz, Iran
4 h-index
6 publications
209 citations
University of California, Berkeley
Berkeley, United States
3 h-index
6 publications
122 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
70 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
308 citations
University of Washington
Seattle, United States
2 h-index
5 publications
258 citations
Sri Sivasubramaniya Nadar College of Engineering
Chennai, India
2 h-index
2 publications
39 citations
1–8 of 118
4 publications · 212 citations
4
h-index
3 publications · 121 citations
3
h-index
3 publications · 53 citations
3
h-index
3 publications · 164 citations
3
h-index
JGAA · 3 publications · 69 citations
3
h-index
1–5