The Channel Assignment Problem with Variable Weights
From MaRDI portal
Publication:5757386
DOI10.1137/040619636zbMath1146.94003WikidataQ57601536 ScholiaQ57601536MaRDI QIDQ5757386
Publication date: 6 September 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040619636
Related Items
Radio $k$-labeling of paths, Radio number for the Cartesian product of two trees, Fast exact algorithm for \(L(2,1)\)-labeling of graphs, Randomly colouring graphs (a combinatorial view), Exact algorithms for \(L(2,1)\)-labeling of graphs, Graph labellings with variable weights, a survey, Labeling the \(r\)-path with a condition at distance two, Optimal radio labellings of complete \(m\)-ary trees, Optimal radio labellings of block graphs and line graphs of trees, Parameterized complexity of distance labeling and uniform channel assignment problems, Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems, Fast Exact Algorithm for L(2,1)-Labeling of Graphs