Fractional path coloring with applications to WDM networks
I Caragiannis, A Ferreira, C Kaklamanis… - … and Programming: 28th …, 2001 - Springer
Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 …, 2001•Springer
This paper addresses the natural relaxation of the path coloring problem, in which one
needs to color directed paths on a symmetric directed graph with a minimum number of
colors, in such a way that paths using the same arc of the graph have different colors. This
classic combinatorial problem finds applications in the minimization of the number of
wavelengths in wavelength division multiplexing (wdm) all-optical networks.
needs to color directed paths on a symmetric directed graph with a minimum number of
colors, in such a way that paths using the same arc of the graph have different colors. This
classic combinatorial problem finds applications in the minimization of the number of
wavelengths in wavelength division multiplexing (wdm) all-optical networks.
Abstract
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (wdm) all-optical networks.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果