On the proper interval completion problem within some chordal subclasses

Autores
Dross, François; Hilaire, Claire; Koch, Ivo; Leoni, Valeria Alejandra; Pardal, Nina; Lopez Pujato, María Inés; Fernandes Dos Santos, Vinicius
Año de publicación
2025
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Given a property (graph class) , a graph G, and an integer k, the -completion problem consists of deciding whether we can turn G into a graph with the property by adding at most k edges to G. The -completion problem is known to be NP-hard for general graphs when is the property of being a proper interval graph (PIG). In this work, we study the PIG-completion problem within different subclasses of chordal graphs. We show that the problem remains NP-complete even when restricted to split graphs. We then turn our attention to positive results and present polynomial time algorithms to solve the PIGcompletion problem when the input is restricted to caterpillar and threshold graphs. We also present an efficient algorithm for the minimum co-bipartite-completion for quasithreshold graphs, which provides a lower bound for the PIG-completion problem within this graph class.
Fil: Dross, François. Université de Bordeaux; Francia
Fil: Hilaire, Claire. University of Primorska; Eslovenia
Fil: Koch, Ivo. Universidad Nacional de General Sarmiento; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura. Escuela de Ciencias Básicas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Pardal, Nina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Lopez Pujato, María Inés. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Fernandes Dos Santos, Vinicius. Universidade Federal de Minas Gerais; Brasil
Materia
bbb
bb
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/266756
Acceder
id CONICETDig_6623d02145c4658340ba5456bae4a2d3
oai_identifier_str oai:ri.conicet.gov.ar:11336/266756
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On the proper interval completion problem within some chordal subclassesDross, FrançoisHilaire, ClaireKoch, IvoLeoni, Valeria AlejandraPardal, NinaLopez Pujato, María InésFernandes Dos Santos, Viniciusbbbbbhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1Given a property (graph class) , a graph G, and an integer k, the -completion problem consists of deciding whether we can turn G into a graph with the property by adding at most k edges to G. The -completion problem is known to be NP-hard for general graphs when is the property of being a proper interval graph (PIG). In this work, we study the PIG-completion problem within different subclasses of chordal graphs. We show that the problem remains NP-complete even when restricted to split graphs. We then turn our attention to positive results and present polynomial time algorithms to solve the PIGcompletion problem when the input is restricted to caterpillar and threshold graphs. We also present an efficient algorithm for the minimum co-bipartite-completion for quasithreshold graphs, which provides a lower bound for the PIG-completion problem within this graph class.Fil: Dross, François. Université de Bordeaux; FranciaFil: Hilaire, Claire. University of Primorska; EsloveniaFil: Koch, Ivo. Universidad Nacional de General Sarmiento; ArgentinaFil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura. Escuela de Ciencias Básicas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaFil: Pardal, Nina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; ArgentinaFil: Lopez Pujato, María Inés. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaFil: Fernandes Dos Santos, Vinicius. Universidade Federal de Minas Gerais; BrasilElsevier Science2025-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/266756Dross, François; Hilaire, Claire; Koch, Ivo; Leoni, Valeria Alejandra; Pardal, Nina; et al.; On the proper interval completion problem within some chordal subclasses; Elsevier Science; Discrete Mathematics; 348; 1; 1-2025; 1-150012-365XCONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.disc.2024.114274info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0012365X24004059info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:06:13Zoai:ri.conicet.gov.ar:11336/266756instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:06:13.806CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On the proper interval completion problem within some chordal subclasses
title On the proper interval completion problem within some chordal subclasses
spellingShingle On the proper interval completion problem within some chordal subclasses
Dross, François
bbb
bb
title_short On the proper interval completion problem within some chordal subclasses
title_full On the proper interval completion problem within some chordal subclasses
title_fullStr On the proper interval completion problem within some chordal subclasses
title_full_unstemmed On the proper interval completion problem within some chordal subclasses
title_sort On the proper interval completion problem within some chordal subclasses
dc.creator.none.fl_str_mv Dross, François
Hilaire, Claire
Koch, Ivo
Leoni, Valeria Alejandra
Pardal, Nina
Lopez Pujato, María Inés
Fernandes Dos Santos, Vinicius
author Dross, François
author_facet Dross, François
Hilaire, Claire
Koch, Ivo
Leoni, Valeria Alejandra
Pardal, Nina
Lopez Pujato, María Inés
Fernandes Dos Santos, Vinicius
author_role author
author2 Hilaire, Claire
Koch, Ivo
Leoni, Valeria Alejandra
Pardal, Nina
Lopez Pujato, María Inés
Fernandes Dos Santos, Vinicius
author2_role author
author
author
author
author
author
dc.subject.none.fl_str_mv bbb
bb
topic bbb
bb
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Given a property (graph class) , a graph G, and an integer k, the -completion problem consists of deciding whether we can turn G into a graph with the property by adding at most k edges to G. The -completion problem is known to be NP-hard for general graphs when is the property of being a proper interval graph (PIG). In this work, we study the PIG-completion problem within different subclasses of chordal graphs. We show that the problem remains NP-complete even when restricted to split graphs. We then turn our attention to positive results and present polynomial time algorithms to solve the PIGcompletion problem when the input is restricted to caterpillar and threshold graphs. We also present an efficient algorithm for the minimum co-bipartite-completion for quasithreshold graphs, which provides a lower bound for the PIG-completion problem within this graph class.
Fil: Dross, François. Université de Bordeaux; Francia
Fil: Hilaire, Claire. University of Primorska; Eslovenia
Fil: Koch, Ivo. Universidad Nacional de General Sarmiento; Argentina
Fil: Leoni, Valeria Alejandra. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura. Escuela de Ciencias Básicas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Pardal, Nina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Lopez Pujato, María Inés. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Fernandes Dos Santos, Vinicius. Universidade Federal de Minas Gerais; Brasil
description Given a property (graph class) , a graph G, and an integer k, the -completion problem consists of deciding whether we can turn G into a graph with the property by adding at most k edges to G. The -completion problem is known to be NP-hard for general graphs when is the property of being a proper interval graph (PIG). In this work, we study the PIG-completion problem within different subclasses of chordal graphs. We show that the problem remains NP-complete even when restricted to split graphs. We then turn our attention to positive results and present polynomial time algorithms to solve the PIGcompletion problem when the input is restricted to caterpillar and threshold graphs. We also present an efficient algorithm for the minimum co-bipartite-completion for quasithreshold graphs, which provides a lower bound for the PIG-completion problem within this graph class.
publishDate 2025
dc.date.none.fl_str_mv 2025-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/266756
Dross, François; Hilaire, Claire; Koch, Ivo; Leoni, Valeria Alejandra; Pardal, Nina; et al.; On the proper interval completion problem within some chordal subclasses; Elsevier Science; Discrete Mathematics; 348; 1; 1-2025; 1-15
0012-365X
CONICET Digital
CONICET
url http://hdl.handle.net/11336/266756
identifier_str_mv Dross, François; Hilaire, Claire; Koch, Ivo; Leoni, Valeria Alejandra; Pardal, Nina; et al.; On the proper interval completion problem within some chordal subclasses; Elsevier Science; Discrete Mathematics; 348; 1; 1-2025; 1-15
0012-365X
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.disc.2024.114274
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0012365X24004059
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269947614461952
score 13.13397

Publicaciones similares