Inscriere cercetatori

Perioada scursă de la depunerea aplicațiilor

Proiecte de cercetare postdoctorala (PD)

Proiecte complexe de cercetare de frontiera (PCCF)

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa


Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Articol în volumul unei conferinţe

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.


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

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