On the span in channel assignment problems: bounds, computing and counting
- 6 May 2003
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 266 (1-3) , 387-397
- https://doi.org/10.1016/s0012-365x(02)00821-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Discrete Mathematics and Radio Channel AssignmentPublished by Springer Nature ,2003
- Methods and Algorithms for Radio Channel AssignmentPublished by Oxford University Press (OUP) ,2002
- Channel Assignment on Nearly Bipartite and Bounded Treewidth GraphsElectronic Notes in Discrete Mathematics, 2001
- Frequency-distance constraints with large distancesDiscrete Mathematics, 2000
- Arrangements, Channel Assignments, and Associated PolynomialsAdvances in Applied Mathematics, 1999
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- Bounds for the frequency assignment problemDiscrete Mathematics, 1997
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976