The Channel Assignment Problem with Variable Weights

DOI10.1137/040619636zbMath1146.94003OpenAlexW2076840073WikidataQ57601536 ScholiaQ57601536MaRDI QIDQ5757386

Daniel Král'

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

zbMATH Keywords

channel assignment problemgraph labeling with distance conditions

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Communication theory (94A05)

Related Items (12)

Parameterized complexity of distance labeling and uniform channel assignment problems ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ Radio number for the Cartesian product of two trees ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ Radio $k$-labeling of paths ⋮ 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 ⋮ Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems

This page was built for publication: The Channel Assignment Problem with Variable Weights