Fractional path coloring on bounded degree trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2001

Fractional path coloring on bounded degree trees


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.
Fichier principal
Vignette du fichier
cfk01.pdf (191.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00429854 , version 1 (04-11-2009)


  • HAL Id : hal-00429854 , version 1


Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano. Fractional path coloring on bounded degree trees. Proceedings of the 28th ICALP, Jul 2001, Greece. pp.732--743. ⟨hal-00429854⟩
120 View
70 Download


Gmail Facebook Twitter LinkedIn More