Topological Sorting
Topological Sorting is a linear ordering of the vertices in a directed acyclic graph such that for every directed edge (u, v), vertex u appears before vertex v in the ordering.
60
Publications
2.9K
Citations
146
Authors
88
Institutions
Publications per year
2017–2026
13
Parents
60
Topological sorting of large networks
Arthur B. Kahn · Communications of the ACM · 1962 · 738 citations · Full text
Noga Alon · SIAM Journal on Discrete Mathematics · 2006 · 227 citations
Ming‐Ming Cheng, Fang‐Lue Zhang, Niloy J. Mitra et al. · ACM Transactions on Graphics · 2010 · 194 citations
1–5 of 60
146
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 146
88
Chinese University of Hong Kong
Hong Kong, Hong Kong
3 h-index
6 publications
124 citations

Lehigh University
Bethlehem, United States
3 h-index
3 publications
233 citations
Brown University
Providence, United States
3 h-index
5 publications
161 citations
Indian Institute of Technology Delhi
New Delhi, India
3 h-index
3 publications
233 citations
Tsinghua University
Beijing, China
3 h-index
9 publications
699 citations
University of Stuttgart
Stuttgart, Germany
2 h-index
4 publications
74 citations
University of Southern California
Los Angeles, United States
2 h-index
2 publications
53 citations
Dalhousie University
Halifax, Canada
2 h-index
3 publications
61 citations
1–8 of 88
JEA · 3 publications · 114 citations
3
h-index
2 publications · 122 citations
2
h-index
2 publications · 85 citations
2
h-index
TOG · 2 publications · 219 citations
2
h-index
2 publications · 89 citations
2
h-index
1–5