64 search results - page 1 / 13 » Channel assignment and weighted coloring |
NETWORKS
2000
13 years 5 months ago
2000
PERCOM
2006
ACM
14 years 5 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
ICPP
2006
IEEE
13 years 11 months ago
2006
IEEE
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...