Label-correcting Algorithms

Label-Correcting Algorithms is a class of shortest path algorithms that iteratively refine distance labels associated with nodes in a graph until optimal shortest path distances are achieved, distinguished from label-setting methods by allowing tentative labels to be updated multiple times based on incoming relaxation steps.

57

Publications

2.4K

Citations

158

Authors

95

Institutions

Publications per year

2017–2026

14

Authors

158

  1. RM
    Roberto Musmanno

    University of Calabria, Italy

    3 publications · 178 citations

    3

    h-index

  2. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    3 publications · 235 citations

    3

    h-index

  3. FG
    Francesca Guerriero

    University of Calabria, Italy

    3 publications · 178 citations

    3

    h-index

  4. ON
    Ofir Nachum

    Google (United States), United States

    2 publications · 142 citations

    2

    h-index

  5. YN
    Yu Nie

    Northwestern University, United States

    2 publications · 62 citations

    2

    h-index

1–5 of 158

Venues

  1. Networks

    8 publications · 449 citations

    8

    h-index

  2. 3

    h-index

  3. 3

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 156 citations

    2

    h-index

  5. 1

    h-index

1–5