Graph Algorithms

Graph Algorithms is a subfield of algorithm design that focuses on the development and analysis of computational methods for solving problems related to graphs, specifically by exploiting their structural properties such as vertices, edges, and connectivity patterns.

37K

Publications

2.2M

Citations

41.4K

Authors

5.6K

Institutions

Publications per year

2017–2026

7.8K

Variants

Distributed-memory Parallel AlgorithmsParallel Approximation AlgorithmsParallel Numerical AlgorithmsParallel Randomized AlgorithmsShared-memory Parallel Algorithms

Authors

41.4K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    98 publications · 34.1K citations

    63

    h-index

  2. NA
    Noga Alon

    Tel Aviv University, Israel

    157 publications · 11.3K citations

    62

    h-index

  3. FH
    Frank Harary

    University of Michigan, United States

    129 publications · 12.3K citations

    52

    h-index

  4. XL
    Xuemin Lin

    UNSW Sydney, Australia

    121 publications · 6.5K citations

    46

    h-index

  5. İG
    İvan Gutman

    University of Kragujevac, Serbia

    133 publications · 7.5K citations

    45

    h-index

1–5 of 41.4K

Venues

  1. SIAM Journal on Computing

    542 publications · 71.5K citations

    125

    h-index

  2. Journal of Combinatorial Theory Series B

    896 publications · 45.3K citations

    98

    h-index

  3. Discrete Mathematics

    1.9K publications · 66.2K citations

    98

    h-index

  4. arXiv (Cornell University)

    Repository · 1.2K publications · 51.8K citations

    96

    h-index

  5. Journal of the ACM

    JACM · 198 publications · 37.3K citations

    88

    h-index

1–5