On the Minimum Sum Coloring of P 4-Sparse Graphs

Mostrar todas las versiones(2)

In this paper, we study the minimum sum coloring (MSC) problem on P 4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum of the numbers assigned to the vertices is minimum. Based in the concept of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Valencia-Pabon, M.
Formato: INPR
Lenguaje:English
Materias:
Graph coloring
Minimum sum coloring
P 4-sparse graphs
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_09110119_v_n_p1_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id todo:paper_09110119_v_n_p1_Bonomo
record_format dspace
spelling todo:paper_09110119_v_n_p1_Bonomo2023-10-03T15:44:39Z On the Minimum Sum Coloring of P 4-Sparse Graphs Bonomo, F. Valencia-Pabon, M. Graph coloring Minimum sum coloring P 4-sparse graphs In this paper, we study the minimum sum coloring (MSC) problem on P 4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum of the numbers assigned to the vertices is minimum. Based in the concept of maximal sequence associated with an optimal solution of the MSC problem of any graph, we show that there is a large sub-family of P 4-sparse graphs for which the MSC problem can be solved in polynomial time. Moreover, we give a parameterized algorithm and a 2-approximation algorithm for the MSC problem on general P 4-sparse graphs. © 2012 Springer Japan. Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. INPR English info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_09110119_v_n_p1_Bonomo
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
language English
orig_language_str_mv English
topic Graph coloring
Minimum sum coloring
P 4-sparse graphs
spellingShingle Graph coloring
Minimum sum coloring
P 4-sparse graphs
Bonomo, F.
Valencia-Pabon, M.
On the Minimum Sum Coloring of P 4-Sparse Graphs
topic_facet Graph coloring
Minimum sum coloring
P 4-sparse graphs
description In this paper, we study the minimum sum coloring (MSC) problem on P 4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum of the numbers assigned to the vertices is minimum. Based in the concept of maximal sequence associated with an optimal solution of the MSC problem of any graph, we show that there is a large sub-family of P 4-sparse graphs for which the MSC problem can be solved in polynomial time. Moreover, we give a parameterized algorithm and a 2-approximation algorithm for the MSC problem on general P 4-sparse graphs. © 2012 Springer Japan.
format INPR
author Bonomo, F.
Valencia-Pabon, M.
author_facet Bonomo, F.
Valencia-Pabon, M.
author_sort Bonomo, F.
title On the Minimum Sum Coloring of P 4-Sparse Graphs
title_short On the Minimum Sum Coloring of P 4-Sparse Graphs
title_full On the Minimum Sum Coloring of P 4-Sparse Graphs
title_fullStr On the Minimum Sum Coloring of P 4-Sparse Graphs
title_full_unstemmed On the Minimum Sum Coloring of P 4-Sparse Graphs
title_sort on the minimum sum coloring of p 4-sparse graphs
url http://hdl.handle.net/20.500.12110/paper_09110119_v_n_p1_Bonomo
work_keys_str_mv AT bonomof ontheminimumsumcoloringofp4sparsegraphs
AT valenciapabonm ontheminimumsumcoloringofp4sparsegraphs
_version_ 1782029130820222976

Ejemplares similares