Abstract
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 $$\pi (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 $$\pi $$ can be achieved in $$O(\log n)$$ rounds. This is optimal for constant d and resolves a problem of Alon et al. (SIAM J Discret Math 7:516–530, 1994).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
