Approximable Row-column Routing Problems in All-Optical Mesh Networks, 2006. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00150160
The complexity of path coloring and call scheduling, Theoretical Computer Science, vol.255, issue.1-2, 2006. ,
DOI : 10.1016/S0304-3975(99)00152-8
The Complexity of Coloring Circular Arcs and Chords, Journal on Algorithms and Discrete Methods, 1980. ,
DOI : 10.1137/0601025
Paths Coloring Algorithms in Mesh Networks, Discrete Mathematics and Theoretical Computer Science : 4TH International Conference, 2003. ,
DOI : 10.1007/3-540-45066-1_15
Approximability of Paths Coloring Problem in Mesh and Torus Networks Mathematics and Computer Science II : Algorithms, Trees, Combinatorics and Probabilities, 2002. ,