Fractional path coloring on bounded degree trees
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...