3 citations · 8 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier
Shimon Kogan, Merav Parter
For an -vertex digraph , a \emph{shortcut set} is a (small) subset of edges taken from the transitive closure of that, when added to guarantees that the dia…
cs.DS2021★ 3 cited
Low-Congestion Shortcuts in Constant Diameter Graphs
Shimon Kogan, Merav Parter
Low congestion shortcuts, introduced by Ghaffari and Haeupler (SODA 2016), provide a unified framework for global optimization problems in the congest model of distributed computin…