Channel assignment problem and n-fold t-separated $$L(j_1,j_2,\ldots ,j_m)$$L(j1,j2,…,jm)-labeling of graphs
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0255-0
Abstract: This paper considers the channel assignment problem in mobile communications systems. Suppose there are many base stations in an area, each of which demands a number of channels to transmit signals. The channels assigned to… read more here.
Keywords: separated ldots; channel assignment; fold separated; ldots labeling ... See more keywords