Exploring the complexity boundary between coloring and list-coloring

Mostrar todas las versiones(2)

Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring problem is NP-complete for many subclasses of perfect graphs. In this work we explore the complexity boundary between vertex c...

Descripción completa

Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Marenco, J.
Formato: JOUR
Materias:
Coloring
Computational complexity
List-coloring
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_02545330_v169_n1_p3_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id todo:paper_02545330_v169_n1_p3_Bonomo
record_format dspace
spelling todo:paper_02545330_v169_n1_p3_Bonomo2023-10-03T15:11:34Z Exploring the complexity boundary between coloring and list-coloring Bonomo, F. Durán, G. Marenco, J. Coloring Computational complexity List-coloring Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring problem is NP-complete for many subclasses of perfect graphs. In this work we explore the complexity boundary between vertex coloring and list-coloring on such subclasses of perfect graphs where the former admits polynomial-time algorithms but the latter is NP-complete. Our goal is to analyze the computational complexity of coloring problems lying "between" (from a computational complexity viewpoint) these two problems: precoloring extension, μ-coloring, and (γ,μ)-coloring. © 2008 Springer Science+Business Media, LLC. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_02545330_v169_n1_p3_Bonomo
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Coloring
Computational complexity
List-coloring
spellingShingle Coloring
Computational complexity
List-coloring
Bonomo, F.
Durán, G.
Marenco, J.
Exploring the complexity boundary between coloring and list-coloring
topic_facet Coloring
Computational complexity
List-coloring
description Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring problem is NP-complete for many subclasses of perfect graphs. In this work we explore the complexity boundary between vertex coloring and list-coloring on such subclasses of perfect graphs where the former admits polynomial-time algorithms but the latter is NP-complete. Our goal is to analyze the computational complexity of coloring problems lying "between" (from a computational complexity viewpoint) these two problems: precoloring extension, μ-coloring, and (γ,μ)-coloring. © 2008 Springer Science+Business Media, LLC.
format JOUR
author Bonomo, F.
Durán, G.
Marenco, J.
author_facet Bonomo, F.
Durán, G.
Marenco, J.
author_sort Bonomo, F.
title Exploring the complexity boundary between coloring and list-coloring
title_short Exploring the complexity boundary between coloring and list-coloring
title_full Exploring the complexity boundary between coloring and list-coloring
title_fullStr Exploring the complexity boundary between coloring and list-coloring
title_full_unstemmed Exploring the complexity boundary between coloring and list-coloring
title_sort exploring the complexity boundary between coloring and list-coloring
url http://hdl.handle.net/20.500.12110/paper_02545330_v169_n1_p3_Bonomo
work_keys_str_mv AT bonomof exploringthecomplexityboundarybetweencoloringandlistcoloring
AT durang exploringthecomplexityboundarybetweencoloringandlistcoloring
AT marencoj exploringthecomplexityboundarybetweencoloringandlistcoloring
_version_ 1807314833051222016

Ejemplares similares