Channel assignment on graphs of bounded treewidth.
The following 'constraint matrix span problem' arises in the assignment of radio channels in cellular communications systems. Given a graph G with a positive integer length l(xy) for each edge xy, and given a positive integer B, can we assign to each vertex x a channel φ(x) from 1,...,B su...
| Autores principales: | , |
|---|---|
| Formato: | Conference item |
| Publicado: |
2003
|