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
24
1–5 of 24
68
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 68
42

Centre National de la Recherche Scientifique
Paris, France
2 h-index
5 publications
116 citations
Université Paris-Sud
Orsay, France
2 h-index
5 publications
116 citations
Microsoft (United States)
Redmond, United States
2 h-index
3 publications
102 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
2 h-index
5 publications
116 citations
University of Connecticut
Storrs, United States
2 h-index
2 publications
50 citations
Northwest A&F University
Yangling, China
1 h-index
1 publications
35 citations
University of Arizona
Tucson, United States
1 h-index
1 publications
19 citations

Beihang University
Beijing, China
1 h-index
5 publications
95 citations
1–8 of 42
3 publications · 69 citations
3
h-index
TON · 1 publications · 48 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5