Dijkstra’s Algorithm Analysis

Dijkstra’s Algorithm Analysis is an academic concept in the field of algorithm analysis that refers to the systematic examination of the time and space complexity, correctness, and performance characteristics of Dijkstra’s shortest path algorithm under various computational models and data structures.

95

Publications

4.6K

Citations

231

Authors

104

Institutions

Publications per year

2017–2026

26

Authors

231

  1. DW
    Dorothea Wagner

    University of Lausanne, Switzerland

    2 publications · 56 citations

    2

    h-index

  2. FS
    Frank Schulz

    University of Patras, Greece

    2 publications · 93 citations

    2

    h-index

  3. RB
    Reinhard Bauer

    Karlsruhe Institute of Technology, Germany

    2 publications · 215 citations

    2

    h-index

  4. DW
    Dorothea Wagner

    Karlsruhe Institute of Technology, Germany

    2 publications · 252 citations

    2

    h-index

  5. DD
    Daniel Delling

    Microsoft (United States), United States

    2 publications · 215 citations

    2

    h-index

1–5 of 231

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 3 publications · 312 citations

    3

    h-index

  2. Procedia Computer Science

    3 publications · 83 citations

    3

    h-index

  3. Information Processing Letters

    2 publications · 44 citations

    2

    h-index

  4. Journal of Discrete Algorithms

    2 publications · 128 citations

    2

    h-index

  5. Applied Soft Computing

    2 publications · 477 citations

    2

    h-index

1–5