55 search results - page 1 / 11 » Linear Orderings of Random Geometric Graphs |
107
Voted
WG
1999
Springer
15 years 4 months ago
1999
Springer
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...
101
Voted
PPL
2000
15 years 20 hour ago
2000
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 ...
113
Voted
CORR
2008
Springer
15 years 10 days ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
111
click to vote
CCCG
2010
15 years 1 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
120
Voted
IM
2008
15 years 7 days ago
2008
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...