36 search results - page 1 / 8 » Channel Assignment on Strongly-Simplicial Graphs |
93
Voted
IPPS
2003
IEEE
15 years 5 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...
99
Voted
WICON
2008
15 years 1 months ago
2008
Many efforts have been devoted to maximizing the network throughput with limited channel resources in multi-radio multi-channel wireless mesh networks. It has been believed that t...
100
Voted
PERCOM
2006
ACM
16 years 4 days 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...
103
click to vote
WG
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
111
Voted
JCO
2007
15 years 13 days ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...