|
Volumn 1256, Issue , 1997, Pages 493-504
|
Constrained bipartite edge coloring with applications to wavelength routing
|
Author keywords
[No Author keywords available]
|
Indexed keywords
AUTOMATA THEORY;
COLOR;
FORESTRY;
POLYNOMIAL APPROXIMATION;
ALL- OPTICAL NETWORKS;
BIPARTITE EDGE COLORING;
BIPARTITE GRAPHS;
EFFICIENT ROUTING;
GREEDY ALGORITHMS;
MAXIMUM LOAD;
POLYNOMIAL-TIME;
WAVELENGTH ROUTING;
TREES (MATHEMATICS);
|
EID: 84951197332
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-63165-8_205 Document Type: Conference Paper |
Times cited : (29)
|
References (12)
|