Congested Clique Algorithms for Graph Spanners

05/14/2018
by   Merav Parter, et al.
0

Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling schemes and routing to solving linear systems and spectral sparsification. A k-spanner maintains pairwise distances up to multiplicative factor of k. It is a folklore that for every n-vertex graph G, one can construct a (2k-1) spanner with O(n^1+1/k) edges. In a distributed setting, such spanners can be constructed in the standard CONGEST model using O(k^2) rounds, when randomization is allowed. In this work, we consider spanner constructions in the congested clique model, and show: (1) A randomized construction of a (2k-1)-spanner with O(n^1+1/k) edges in O( k) rounds. The previous best algorithm runs in O(k) rounds. (2) A deterministic construction of a (2k-1)-spanner with O(n^1+1/k) edges in O( k +( n)^3) rounds. The previous best algorithm runs in O(k n) rounds. This improvement is achieved by a new derandomization theorem for hitting sets which might be of independent interest. (3) A deterministic construction of a O(k)-spanner with O(k · n^1+1/k) edges in O( k) rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2018

(Δ+1) Coloring in the Congested Clique Model

In this paper, we present improved algorithms for the (Δ+1) (vertex) col...
research
02/21/2018

MIS in the Congested Clique Model in O( Δ) Rounds

We give a maximal independent set (MIS) algorithm that runs in O(Δ) roun...
research
07/25/2019

Fast Deterministic Constructions of Linear-Size Spanners and Skeletons

In the distributed setting, the only existing constructions of sparse sk...
research
09/08/2022

Routing permutations on spectral expanders via matchings

We consider the following matching-based routing problem. Initially, eac...
research
04/17/2019

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

An (ϵ,ϕ)-expander decomposition of a graph G=(V,E) is a clustering of th...
research
11/17/2019

Sparse Hopsets in Congested Clique

We give the first Congested Clique algorithm that computes a sparse hops...
research
11/16/2018

A Spanner for the Day After

We show how to construct (1+ε)-spanner over a set P of n points in R^d t...

Please sign up or login with your details

Forgot password? Click here to reset