Approximability of Paths Coloring Problem in Mesh and Torus Networks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2002

Approximability of Paths Coloring Problem in Mesh and Torus Networks

Jérôme Palaysi
  • Function : Author
  • PersonId : 938554
No file

Dates and versions

lirmm-00268462 , version 1 (01-04-2008)

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⟩
41 View
0 Download

Share

Gmail Facebook X LinkedIn More