A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2015

A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs

Résumé

In this note we show a one-to-one correspondence between potentially optimal solutions to the cluster deletion problem in a graph G and potentially optimal solutions for the minimum sum coloring problem in G (i.e. the complement graph of G). We apply this correspondence to polynomially solve the cluster deletion problem in a subclass of P 4 -sparse graphs that strictly includes P 4 -reducible graphs.
Fichier principal
Vignette du fichier
cluster-del-p4-sparse-v1.pdf (223.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01102515 , version 1 (13-01-2015)

Identifiants

  • HAL Id : hal-01102515 , version 1

Citer

Flavia Bonomo, Guillermo Duran, Amedeo Napoli, Mario Valencia-Pabon. A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs. Information Processing Letters, 2015, 115 (6-8), pp.600-603. ⟨hal-01102515⟩
276 Consultations
123 Téléchargements

Partager

Gmail Facebook X LinkedIn More