Frequency assignment problems with various constraints

Studies the problem of assigning a collection of operating frequencies to a collection of radio transmitters under various constraints including co-channel constraints, adjacent-channel constraints and co-site constraints using graph-colouring methods. Traditionally, these methods have been applied only to the co-channel constraint problem. The authors show how they can be generalised to apply to all cases. They also give two new graph colouring algorithms that can be applied to the problem which are modifications of the smallest-last algorithm.<
>