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

Authors

146

  1. XH
    Xiaolei Huang

    Lehigh University, United States

    3 publications · 233 citations

    3

    h-index

  2. JS
    Jeffrey Scott Vitter

    Duke University, United States

    3 publications · 93 citations

    3

    h-index

  3. MC
    Ming‐Ming Cheng

    Nankai University, China

    3 publications · 233 citations

    3

    h-index

  4. SH
    Shi‐Min Hu

    Tsinghua University, China

    3 publications · 233 citations

    3

    h-index

  5. FZ
    Fang‐Lue Zhang

    Tsinghua University, China

    3 publications · 233 citations

    3

    h-index

1–5 of 146

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 3 publications · 114 citations

    3

    h-index

  2. Information Processing Letters

    2 publications · 122 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 85 citations

    2

    h-index

  4. ACM Transactions on Graphics

    TOG · 2 publications · 219 citations

    2

    h-index

  5. The Computer Journal

    2 publications · 89 citations

    2

    h-index

1–5