On the span in channel assignment problems: bounds, computing and counting
The channel assignment problem involves assigning radio channels to transmitters, using a small span of channels but without causing excessive interference. We consider a standard model for channel assignment, the constraint matrix model, which extends ideas of graph colouring. Given a graph G = (V,...
| 第一著者: | |
|---|---|
| フォーマット: | Conference item |
| 出版事項: |
2003
|
Search Result 1
On the span in channel assignment problems: Bounds, computing and counting
出版事項 2003
Journal article