A Fast Algorithm to Solve the Frequency Assignment Problem

2009 ◽  
pp. 316-318
Author(s):  
Mohammad Dib ◽  
Alexandre Caminada ◽  
Hakim Mabed
Keyword(s):  
Fast Algorithm ◽  
Assignment Problem ◽  
Frequency Assignment ◽  
Frequency Assignment Problem

Frequency assignment problem in satellite communications using differential evolution

2010 ◽  
Vol 37 (12) ◽  
pp. 2152-2163 ◽  
Author(s):  
Ayed A. Salman ◽  
Imtiaz Ahmad ◽  
Mahamed G.H. Omran ◽  
Mohammad Gh. Mohammad
Keyword(s):  
Differential Evolution ◽  
Assignment Problem ◽  
Satellite Communications ◽  
Frequency Assignment ◽  
Frequency Assignment Problem

Scalability and robustness of parallel hyperheuristics applied to a multiobjectivised frequency assignment problem

2012 ◽  
Vol 17 (6) ◽  
pp. 1077-1093 ◽  
Author(s):  
Carlos Segura ◽  
Eduardo Segredo ◽  
Coromoto León
Keyword(s):  
Assignment Problem ◽  
Frequency Assignment ◽  
Frequency Assignment Problem

scholarly journals Efficient Algorithm For L(3,2,1)-Labeling of Cartesian Product Between Some Graphs

10.29007/x3qf ◽  
2019 ◽  
Author(s):  
Sumonta Ghosh ◽  
Prakhar Pogde ◽  
Narayan C. Debnath ◽  
Anita Pal
Keyword(s):  
Communication Network ◽  
Assignment Problem ◽  
Efficient Algorithm ◽  
Time Complexity ◽  
Cartesian Product ◽  
Frequency Assignment ◽  
Frequency Assignment Problem ◽  
The Difference

L(h,k) Labeling in graph came into existence as a solution to frequency assignment problem. To reduce interference a frequency in the form of non negative integers is assigned to each radio or TV transmitters located at various places. After L(h,k) labeling, L(h,k, j) labeling is introduced to reduce noise in the communication network. We investigated the graph obtained by Cartesian Product betweenCompleteBipartiteGraphwithPathandCycle,i. e.,Km,n×Pr andKm,n×Cr byapplying L(3,2,1)Labeling. The L(3,2,1) Labeling of a graph G is the difference between the highest and the lowest labels used in L(3,2,1) and is denoted by λ3,2,1(G) In this paper we have designed three suitable algorithms to label the graphs Km,n × Pr and Km,n × Cr . We have also analyzed the time complexity of each algorithm with illustration.

Sign in / Sign up

Export Citation Format

Share Document