464 citations · 973 across the 14 of their papers we have counts for
1 paper · 1 filter
Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its com…