Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...