Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Christopher L. Barrett, V. S. Anil Kumar, MADHAV V. MARATHE, Shripad Thite, Gabriel Istrate · 2006
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network