Showing 2019Show all
2 papers · 1 filter
cs.DC2019
Fast Deterministic Constructions of Linear-Size Spanners and Skeletons
Michael Elkin, Shaked Matar
In the distributed setting, the only existing constructions of \textit{sparse skeletons}, (i.e., subgraphs with edges) either use randomization or large messages, or require…
cs.DC2019
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
Michael Elkin, Shaked Matar
Given parameters , a subgraph of an -vertex unweighted undirected graph is called an -spanner if for every pair of vertic…