Showing 2023Show all
2 papers · 1 filter
cs.DC2023
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…
cs.DS2023
Near Tight Shortest Paths in the Hybrid Model
Philipp Schneider
Shortest paths problems are subject to extensive studies in classic distributed models such as the CONGEST or Congested Clique. These models dictate how nodes may communicate in or…