Abstract:In this work we study a problem of finding minimum coloured paths in graphs that has applications in WDM optical networks when high bandwidths are required to send data between a pair of nodes in the graph. Let G = (V, E) be a (directed) graph with a set of nodes V and a set of edges E in which each edge has an associated positive weight w(i, j), and C = {1, 2, . . . , x} be a set of x colours, x ∈ N. The function c : E → 2 C maps each edge of the graph G to a subset of colours, where 2 C is the power set of C… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.