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

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01102515
Contributor : Mario Valencia <>
Submitted on : Tuesday, January 13, 2015 - 2:17:02 PM
Last modification on : Thursday, September 5, 2019 - 4:43:56 PM
Long-term archiving on : Tuesday, April 14, 2015 - 10:26:41 AM

Files

cluster-del-p4-sparse-v1.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01102515, version 1

Citation

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, Elsevier, 2015, 115 (6-8), pp.600-603. ⟨hal-01102515⟩

Share

Metrics

Record views

535

Files downloads

159