Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model

Philipp Schneider

A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graph…