21 citations · 44 across the 25 of their papers we have counts for
Showing 2022 · cs.DSShow all
2 papers · 2 filters
cs.DS2022★ 1 cited
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
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…
cs.DS2022★ 7 cited
On the External Validity of Average-Case Analyses of Graph Algorithms
Thomas Bläsius, Philipp Fischbeck
The number one criticism of average-case analysis is that we do not actually know the probability distribution of real-world inputs. Thus, analyzing an algorithm on some random mod…