DAM
2008
13 years 4 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
ICCS
2004
Springer
13 years 10 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...