Fractional path coloring on bounded degree trees

Ioannis Caragiannis 1 Afonso Ferreira 2 Christos Kaklamanis 1 Stéphane Pérennes 2 Hervé Rivano 2
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Hervé Rivano <>
Submitted on : Wednesday, November 4, 2009 - 4:45:54 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Thursday, June 17, 2010 - 7:26:16 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads