|
Volumn , Issue , 1996, Pages 400-409
|
Path coloring on the mesh
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
CRITICAL PATH ANALYSIS;
FIBER OPTIC NETWORKS;
ITERATIVE METHODS;
TREES (MATHEMATICS);
ALL OPTICAL NETWORKS;
APPROXIMATION ALGORITHMS;
CIRCUIT ROUTING;
PATH COLORING PROBLEM;
PROBLEM SOLVING;
|
EID: 0030393773
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (36)
|
References (26)
|