2 search results - page 1 / 1 » Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Grap... |
108
click to vote
SIROCCO
2007
15 years 7 days 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...
106
click to vote
IM
2008
14 years 10 months 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...