The permutation-path coloring problem on trees

  • Authors:

  • Sylvie Corteel;Mario Valencia-Pabon;Danièle Gardy;Dominique Barth;Alain Denise

  • Affiliations:

  • PRiSM, Université de Versailles, 45 Av. des Etats Unis, 78035 Versailles, France;L.R.I., Bât 490, Université Paris-Sud, Orsay F-91405, France;PRiSM, Université de Versailles, 45 Av. des Etats Unis, 78035 Versailles, France;PRiSM, Université de Versailles, 45 Av. des Etats Unis, 78035 Versailles, France;L.R.I., Bât 490, Université Paris-Sud, Orsay F-91405, France

  • Venue:
  • Theoretical Computer Science - Latin American theoretical informatics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we first show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and for circular permutations, which are permutations that contain exactly one cycle, on trees with maximum degree greater than or equal to 4. We calculate a lower bound on the average complexity of the permutation-path coloring problem on arbitrary networks. Then we give combinatorial and asymptotic results for the permutation-path coloring problem on linear networks in order to show that the average number of colors needed to color any permutation on a linear network on n vertices is n/4 + o(n). We extend these results and obtain an upper bound on the average complexity of the permutation-path coloring problem on arbitrary trees, obtaining exact results in the case of generalized star trees. Finally we explain how to extend these results for the involutions-path coloring problem on arbitrary trees.