Skip to Main content Skip to Navigation
Conference papers

Approximability of Paths Coloring Problem in Mesh and Torus Networks

Jérôme Palaysi 1
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Conference papers
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268462
Contributor : Christine Carvalho de Matos <>
Submitted on : Tuesday, April 1, 2008 - 9:27:25 AM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM

Identifiers

  • HAL Id : lirmm-00268462, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

91