|
Volumn E83-A, Issue 6, 2000, Pages 1222-1226
|
A Scheduling Problem in Multihop Networks
a b c d b
d
CHUO UNIVERSITY
(Japan)
|
Author keywords
Cut covering; Graph theory; Mobile communication; Multihop network; NP complete problem
|
Indexed keywords
ANTITRANSITIVE LABELING;
FREQUENCY BANDS;
MULTIHOP NETWORKS;
ALGORITHMS;
APPROXIMATION THEORY;
CODE DIVISION MULTIPLE ACCESS;
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
PACKET NETWORKS;
MOBILE TELECOMMUNICATION SYSTEMS;
|
EID: 0034207083
PISSN: 09168508
EISSN: None
Source Type: Journal
DOI: None Document Type: Article |
Times cited : (2)
|
References (8)
|