Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disk Graphs. These are geometric graphs such that for some positive integers l,k the following property holds at each node v: if  partition the unit circle centered at v into 2k equally sized dges then each dge can contain at most l points different from v.  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 k and l, 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 2kl+1 and this is optimal for local algorithms (since the maximal degree is 2kl and a colouring with 2kl 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.
['Jurek Czyzowicz', 'Stefan Dobrev', 'Evangelos Kranakis', 'Jaroslav Opatrny', 'Julià Urrutia']
I am writing a research paper on a idea Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
[{"from": "human", "value": "I am writing a research paper on a idea Local edge colouring of Yao-like subgraphs of Unit Disk Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disk Graphs. These are geometric graphs such that for some positive integers l,k the following property holds at each node v: if  partition the unit circle centered at v into 2k equally sized dges then each dge can contain at most l points different from v.  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 k and l, 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 2kl+1 and this is optimal for local algorithms (since the maximal degree is 2kl and a colouring with 2kl 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."}]