1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Thomas Bläsius, Marcus Wilhelm
A common technique to speed up shortest path queries in graphs is to use a bidirectional search, i.e., performing a forward search from the start and a backward search from the des…