Depth-first Search

Depth-First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking, distinguished from other traversal methods by its systematic prioritization of depth over breadth in visiting nodes.

789

Publications

50.9K

Citations

1.9K

Authors

751

Institutions

Publications per year

2017–2026

143

Authors

1.9K

  1. RE
    Richard E. Korf

    University of California, Los Angeles, United States

    16 publications · 894 citations

    13

    h-index

  2. RE
    Robert E. Tarjan

    Princeton University, United States

    9 publications · 9.1K citations

    9

    h-index

  3. RD
    Rina Dechter

    University of California, Irvine, United States

    5 publications · 169 citations

    5

    h-index

  4. RA
    Richard Anderson

    University of Washington, United States

    5 publications · 206 citations

    5

    h-index

  5. WZ
    Weixiong Zhang

    Washington University in St. Louis, United States

    5 publications · 200 citations

    5

    h-index

1–5 of 1.9K

Venues

  1. Information Processing Letters

    18 publications · 1.1K citations

    16

    h-index

  2. SIAM Journal on Computing

    13 publications · 7K citations

    12

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 11 publications · 949 citations

    11

    h-index

  4. arXiv (Cornell University)

    Repository · 9 publications · 437 citations

    9

    h-index

  5. International Joint Conference on Artificial Intelligence

    Conference · 9 publications · 353 citations

    9

    h-index

1–5