77 search results - page 8 / 16 » Ad-hoc networks beyond unit disk graphs |
DAGSTUHL
2006
15 years 3 months ago
2006
125
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
111
click to vote
CCCG
2008
15 years 3 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
165
Voted
DCOSS
2008
Springer
15 years 3 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
141
Voted
SIROCCO
2007
15 years 3 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...