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. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Caragiannis, I., Ferreira, A., Kaklamanis, C., Pérennes, S., & Rivano, H. (2001). Fractional path coloring with applications to WDM networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 732–743). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
