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.
Citation:
Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate, "Strong Edge Coloring for Channel Assignment in Wireless Radio Networks," percomw, pp.106-110, Fourth IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006