Vertex Ordering is a computational method in graph drawing that determines the sequential arrangement of vertices along a line to minimize edge crossings and optimize visual clarity in layered graph layouts.
387
Publications
19.6K
Citations
774
Authors
407
Institutions
Publications per year
2017–2026
32
Parents
Publications
387
E. J. Cockayne, Robyn M. Dawes, Stephen T. Hedetniemi · Networks · 1980 · 690 citations
A technique for drawing directed graphs
Emden R. Gansner, E. Koutsofios, Stephen C. North et al. · IEEE Transactions on Software Engineering · 1993 · 675 citations
1–5 of 387
Authors
774
- YF
6
h-index
- MA
5
h-index
- DR
5
h-index
- WW
5
h-index
- ZP
4
h-index
1–5 of 774
Institutions
407
Rutgers, The State University of New Jersey
New Brunswick, United States
9 h-index
11 publications
801 citations
Beijing Jiaotong University
Beijing, China
8 h-index
13 publications
338 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
13 publications
406 citations
Friedrich Schiller University Jena
Jena, Germany
7 h-index
11 publications
877 citations
Nankai University
Tianjin, China
7 h-index
12 publications
262 citations
The University of Western Australia
Perth, Australia
7 h-index
9 publications
199 citations
Centre National de la Recherche Scientifique
Paris, France
7 h-index
10 publications
206 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
7 publications
175 citations
1–8 of 407
Venues
- Discrete Applied Mathematics
32 publications · 1K citations
19
h-index
- Discrete Mathematics
38 publications · 952 citations
19
h-index
- Journal of Graph Theory
15 publications · 612 citations
14
h-index
- Journal of Combinatorial Theory Series B
16 publications · 704 citations
13
h-index
- Information Processing Letters
13 publications · 576 citations
12
h-index
1–5