Incremental Shortest Path Algorithms
Incremental Shortest Path Algorithms is a class of dynamic shortest path algorithms that, belonging to the broader category of shortest path algorithms, are distinguished by their ability to efficiently update shortest path information in response to incremental changes in the graph structure, such as edge weight modifications or vertex/edge insertions, without re-computing the entire solution from scratch.
50
Publications
2K
Citations
129
Authors
68
Institutions
Publications per year
2017–2026
14
Parents
50
Incremental algorithms for minimal length paths
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela et al. · Journal of Algorithms · 1991 · 154 citations
1–5 of 50
129
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 129
68

Tel Aviv University
Tel Aviv, Israel
4 h-index
4 publications
140 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
8 publications
181 citations

Sapienza University of Rome
Rome, Italy
4 h-index
10 publications
781 citations

University of L'Aquila
L’Aquila, Italy
3 h-index
7 publications
698 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
8 publications
232 citations
Columbia University
New York, United States
3 h-index
6 publications
696 citations
University of Southern California
Los Angeles, United States
3 h-index
9 publications
216 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
2 h-index
3 publications
135 citations
1–8 of 68
Conference · 3 publications · 87 citations
3
h-index
Conference · 2 publications · 56 citations
2
h-index
2 publications · 35 citations
2
h-index
JACM · 2 publications · 34 citations
2
h-index
Repository · 2 publications · 35 citations
2
h-index
1–5