I have weighted graph for sensor networks with aggregation nodes and sensors. There is a edge between two nodes associated with a weight. Higher the weight, stronger the interference between the aggregation nodes if they have same color.
I need to perform graph coloring of these nodes with just K colors. The nodes with higher edge weight should/must have different colors.
What is an efficient way to do the optimal coloring?
May be the coloring of such a big network is too difficult. Instead we can have clusters of nodes and then do the intra-cluster coloring. But then we need to take care of inter-cluster interference.