Dichotomies properties on computational complexity of S-packing coloring problems - Université de Bourgogne Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Dichotomies properties on computational complexity of S-packing coloring problems

Nicolas Gastineau
  • Fonction : Auteur correspondant
  • PersonId : 950056

Connectez-vous pour contacter l'auteur

Résumé

This work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s_1 , ..., s_k ), G is S-colorable, if its vertices can be partitioned into sets S_i , i = 1,... , k, where each S_i being a s_i -packing (a set of vertices at pairwise distance greater than s_i). For a list of three integers, a dichotomy between NP-complete problems and polynomial time solvable problems is determined for subcubic graphs. Moreover, for an unfixed size of list, the complexity of the S-packing coloring problem is determined for several instances of the problem. These properties are used in order to prove a dichotomy between NP-complete problems and polynomial time solvable problems for lists of at most four integers.
Fichier principal
Vignette du fichier
comp_dichvhal.pdf (282.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00920502 , version 1 (18-12-2013)
hal-00920502 , version 2 (17-07-2014)
hal-00920502 , version 3 (29-01-2015)

Identifiants

Citer

Nicolas Gastineau. Dichotomies properties on computational complexity of S-packing coloring problems. 2013. ⟨hal-00920502v2⟩
229 Consultations
190 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More