Autori: Christopher L. Barrett, Gabriel Istrate, V.S. Anil Kumar, Madhav V. Marathe, Shripad Thite and Sunil Thulasidasan

Editorial: IEEE Computer Society Press, ISBN 0-7695-2520-2, Proceedings of the Fourth IEEE International Conference on Pervasive Computing (PERCOMW'06), Workshop on Foundations and Algorithms for Wireless Networking, p.106-110, 2006.

Rezumat:

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.

A preliminary version is freely available from

http://www.win.tue.nl/~sthite/pubs/d2ec-fawn06.pdf

The list of authors, as presented on the publishers’ website below has errors. The correct version (identical to the one from the paper) is given above.

Cuvinte cheie: distance-2 matching, network capacity

URL: http://doi.ieeecomputersociety.org/10.1109/PERCOMW.2006.129