Graph Traversal Algorithms

Graph Traversal Algorithms is a systematic computational method for exploring vertices and edges in a graph by visiting each vertex according to a specific order or strategy, distinguishing it from other graph analysis techniques by its focus on the procedural visitation and examination of graph elements.

385

Publications

30.5K

Citations

1K

Authors

427

Institutions

Publications per year

2017–2026

81

Variants

Graph Search Algorithms

Authors

1K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    7 publications · 9.3K citations

    7

    h-index

  2. PD
    Pradeep Dubey

    Intel (United States), United States

    4 publications · 322 citations

    4

    h-index

  3. NS
    Nadathur Satish

    Intel (United States), United States

    4 publications · 322 citations

    4

    h-index

  4. PR
    Prabhakar Raghavan

    IBM Research - Almaden, United States

    4 publications · 116 citations

    4

    h-index

  5. LC
    Lei Chen

    Hong Kong University of Science and Technology, Hong Kong SAR China

    4 publications · 216 citations

    4

    h-index

1–5 of 1K

Venues

  1. SIAM Journal on Computing

    10 publications · 7.8K citations

    10

    h-index

  2. Information Processing Letters

    10 publications · 412 citations

    10

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 10 publications · 464 citations

    10

    h-index

  4. Discrete Applied Mathematics

    9 publications · 220 citations

    9

    h-index

  5. Theoretical Computer Science

    7 publications · 768 citations

    7

    h-index

1–5