A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-sparse graphs-Reference-Cited by-同舟云学术

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

Published:2015-06 Issue:6-8 Volume:115 Page:600-603
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Bonomo Flavia^ORCID,Duran Guillermo,Napoli Amedeo,Valencia-Pabon Mario

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference15 articles.

1. Correlation clustering;Bansal;Mach. Learn.,2004

2. On chromatic sums and distributed resource allocation;Bar-Noy;Inf. Comput.,1998

3. Even faster parametrized cluster deletion and cluster editing;Böcker;Inf. Process. Lett.,2011

4. Minimum sum coloring of P4-sparse graphs;Bonomo;Electron. Notes Discrete Math.,2009

5. On the minimum sum coloring of P4-sparse graphs;Bonomo;Graphs Comb.,2014

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A fast local search algorithm for minimum sum coloring problem on massive graphs;Computers & Operations Research;2024-12

2. Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm;Knowledge-Based Systems;2022-06

3. Cluster Deletion on Interval Graphs and Split Related Graphs;Algorithmica;2021-03-11

4. A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem;IEEE Access;2020

5. A new approximate cluster deletion algorithm for diamond-free graphs;Journal of Combinatorial Optimization;2019-11-02