![]() |
Volumn 3038, Issue , 2004, Pages 1138-1145
|
Routing and wavelength assignments in optical WDM networks with maximum quantity of edge disjoint paths
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPLEX NETWORKS;
GRAPH THEORY;
INTEGER PROGRAMMING;
NETWORK ARCHITECTURE;
WAVELENGTH DIVISION MULTIPLEXING;
EDGE DISJOINT PATHS;
GRAPH COLORINGS;
GREEDY ALGORITHMS;
INTEGER LINEAR PROGRAMMING;
NOVEL ALGORITHM;
OPTICAL WDM NETWORKS;
OPTIMAL UTILIZATION;
ROUTING AND WAVELENGTH ASSIGNMENT;
NETWORK ROUTING;
|
EID: 25144443912
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-24688-6_147 Document Type: Article |
Times cited : (2)
|
References (8)
|