Conference Papers
Year : 2002
Christine Carvalho De Matos : Connect in order to contact the contributor
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268462
Submitted on : Tuesday, April 1, 2008-9:27:25 AM
Last modification on : Friday, March 24, 2023-2:52:50 PM
Dates and versions
Identifiers
- HAL Id : lirmm-00268462 , version 1
Cite
Jérôme Palaysi. Approximability of Paths Coloring Problem in Mesh and Torus Networks. MathInfo'2002: Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Sep 2002, Université de Versailles Saint Quentin-en-Yvelines, Versailles, France. pp.213-222. ⟨lirmm-00268462⟩
43
View
0
Download