1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich +3
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It h…