|
|
|
Volumn 2, Issue , 1995, Pages 604-608
|
|
Graph theoretic approach to the channel assignment problem in cellular systems
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
CHANNEL CAPACITY;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTATIONAL COMPLEXITY;
CONSTRAINT THEORY;
GRAPH THEORY;
MATRIX ALGEBRA;
OPTIMIZATION;
PERFORMANCE;
TELECOMMUNICATION NETWORKS;
ADJACENT CHANNEL CONSTRAINT;
CHANNEL ASSIGNMENT PROBLEM;
CO-CHANNEL CONSTRAINT;
CO-SITE CONSTRAINT;
COMPATIBILITY MATRIX;
FREQUENCY DIVISION MULTIPLE ACCESS SYSTEMS;
GRAPH COLORING ALGORITHMS;
TIME DIVISION MULTIPLE ACCESS SYSTEMS;
CELLULAR RADIO SYSTEMS;
|
|
EID: 0029182824
PISSN: 07400551
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (7)
|
|
References (8)
|
