By Topic

Frequency assignment problems with various constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ling San ; Dept. of Math., Nat. Univ. of Singapore, Singapore ; Seah Boon Huak ; Tan Eng Chye ; Tan Ser Peow

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

Published in:

Singapore ICCS '94. Conference Proceedings.  (Volume:3 )

Date of Conference:

14-18 Nov 1994