Exact Shortest Path Computation

Exact Shortest Path Computation is a shortest path algorithmic method that belongs to the class of deterministic computational techniques and is distinguished by its guarantee to find the optimal shortest path between nodes in a graph without approximation or error.

59

Publications

3.5K

Citations

127

Authors

77

Institutions

Publications per year

2017–2026

8

Authors

127

  1. LR
    Liam Roditty

    Bar-Ilan University, Israel

    4 publications · 64 citations

    4

    h-index

  2. DS
    Dominik Schultes

    Karlsruhe Institute of Technology, Germany

    3 publications · 379 citations

    3

    h-index

  3. LL
    Leonardo Lozano

    Universidad de Los Andes, Colombia

    2 publications · 226 citations

    2

    h-index

  4. JB
    Jean‐Daniel Boissonnat

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 69 citations

    2

    h-index

  5. HS
    Hiromasa Suzuki

    The University of Tokyo, Japan

    2 publications · 118 citations

    2

    h-index

1–5 of 127

Venues

  1. Computer-Aided Design

    2 publications · 111 citations

    2

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 43 citations

    2

    h-index

  3. Computers & Operations Research

    2 publications · 281 citations

    2

    h-index

  4. Algorithmica

    2 publications · 67 citations

    2

    h-index

  5. Symposium on Discrete Algorithms

    Conference · 2 publications · 83 citations

    2

    h-index

1–5