A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 that for some positive integers l, k the following property holds at each node v: if we partition the unit circle centered at v into 2k equally sized wedges then each wedge can contain at most l points different from v. We assume that the nodes are location aware, i.e. they know their Cartesian coordinates in the plane.doi:10.1016/j.tcs.2008.11.008 fatcat:v2u4d6fq7fhkdpodooib34mh2e