Local edge colouring of Yao-like subgraphs of Unit Disk Graphs

The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of subgraphs of Unit Disk Graphs. These are geometric graphs such that for some positive integers the following property holds at each node : if we partition the unit circle centered at into equally sized wedges then each wedge can contain at most points different from . We assume that the nodes are location aware, i.e. they know their Cartesian coordinates in the plane. The algorithm presented is local in the sense that each node can receive information emanating only from nodes which are at most a constant (depending on and , but not on the size of the graph) number of hops (measured in the original underlying Unit Disk Graph) away from it, and hence the algorithm terminates in a constant number of steps. The number of colours used is and this is optimal for local algorithms (since the maximal degree is and a colouring with colours can only be constructed by a global algorithm), thus showing that in this class of graphs the price for locality is only one additional colour.