Fast Neighborhood Rendezvous

05/08/2021
by   Ryota Eguchi, et al.
0

In the rendezvous problem, two computing entities (called agents) located at different vertices in a graph have to meet at the same vertex. In this paper, we consider the synchronous neighborhood rendezvous problem, where the agents are initially located at two adjacent vertices. While this problem can be trivially solved in O(Δ) rounds (Δ is the maximum degree of the graph), it is highly challenging to reveal whether that problem can be solved in o(Δ) rounds, even assuming the rich computational capability of agents. The only known result is that the time complexity of O(√(n)) rounds is achievable if the graph is complete and agents are probabilistic, asymmetric, and can use whiteboards placed at vertices. Our main contribution is to clarify the situation (with respect to computational models and graph classes) admitting such a sublinear-time rendezvous algorithm. More precisely, we present two algorithms achieving fast rendezvous additionally assuming bounded minimum degree, unique vertex identifier, accessibility to neighborhood IDs, and randomization. The first algorithm runs within Õ(√(nΔ/δ) + n/δ) rounds for graphs of the minimum degree larger than √(n), where n is the number of vertices in the graph, and δ is the minimum degree of the graph. The second algorithm assumes that the largest vertex ID is O(n), and achieves Õ( n/√(δ))-round time complexity without using whiteboards. These algorithms attain o(Δ)-round complexity in the case of δ = ω(√(n)log n) and δ = ω(n^2/3log^4/3 n) respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2018

Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space

The Massive Parallel Computation (MPC) model is a theoretical framework ...
research
02/26/2021

Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs

We introduce the rendezvous game with adversaries. In this game, two pla...
research
05/20/2018

Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

In the minimum k-edge-connected spanning subgraph (k-ECSS) problem the g...
research
12/31/2019

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods

The classical problem of degree sequence realizability asks whether or n...
research
07/18/2019

Very fast construction of bounded-degree spanning graphs via the semi-random graph process

Semi-random processes involve an adaptive decision-maker, whose goal is ...
research
07/28/2019

A Fast Minimum Degree Algorithm and Matching Lower Bound

The minimum degree algorithm is one of the most widely-used heuristics f...
research
09/25/2018

Subexponential algorithms for variants of homomorphism problem in string graphs

We consider the complexity of finding weighted homomorphisms from inters...

Please sign up or login with your details

Forgot password? Click here to reset