Routing permutations on spectral expanders via matchings

09/08/2022
by   Rajko Nenadov, et al.
0

We consider the following matching-based routing problem. Initially, each vertex v of a connected graph G is occupied by a pebble which has a unique destination π(v). In each round the pebbles across the edges of a selected matching in G are swapped, and the goal is to route each pebble to its destination vertex in as few rounds as possible. We show that if G is a sufficiently strong d-regular spectral expander then any permutation π can be achieved in O(log n) rounds. This is optimal for constant d and resolves a problem of Alon, Chung, and Graham [SIAM J. Discrete Math., 7 (1994), pp. 516–530].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2020

Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization

There is a recent exciting line of work in distributed graph algorithms ...
research
05/07/2018

(Δ+1) Coloring in the Congested Clique Model

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

Congested Clique Algorithms for Graph Spanners

Graph spanners are sparse subgraphs that faithfully preserve the distanc...
research
04/10/2023

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications

In the LOCAL model, low-diameter decomposition is a useful tool in desig...
research
07/08/2020

Waypoint Routing on Bounded Treewidth Graphs

In the Waypoint Routing Problem one is given an undirected capacitated a...
research
05/05/2018

Dynamic Monopolies in Reversible Bootstrap Percolation

We study an extremal question for the (reversible) r-bootstrap percolati...
research
07/31/2022

An Experimental Study on Learning Correlated Equilibrium in Routing Games

We study route choice in a repeated routing game where an uncertain stat...

Please sign up or login with your details

Forgot password? Click here to reset