Intervalizing colored graphs is NP-complete for caterpilars with hair length 2

The problem of Intervalizing Colored Graphs has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for kgeq 4 and has polynomial time algorithms for k=2 and k=3....

ver descrição completa

Detalhes bibliográficos
Autores: Álvarez Faura, M. del Carme|||0000-0003-2352-0546, Díaz Cort, Josep|||0000-0003-4422-0067, Serna Iglesias, María José|||0000-0001-9729-8648
Tipo de documento: relatório científico
Data de publicação:1998
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositório:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglês
OAI Identifier:oai:upcommons.upc.edu:2117/96513
Acesso em linha:https://hdl.handle.net/2117/96513
Access Level:Acceso aberto
Palavra-chave:Colored graphs intervalizing
Caterpillars
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_dab2cb9fbf5a5eee3d7404af67d929b9
oai_identifier_str oai:upcommons.upc.edu:2117/96513
network_acronym_str ES
network_name_str España
repository_id_str
spelling Intervalizing colored graphs is NP-complete for caterpilars with hair length 2Álvarez Faura, M. del Carme|||0000-0003-2352-0546Díaz Cort, Josep|||0000-0003-4422-0067Serna Iglesias, María José|||0000-0001-9729-8648Colored graphs intervalizingCaterpillarsÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaThe problem of Intervalizing Colored Graphs has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for kgeq 4 and has polynomial time algorithms for k=2 and k=3. In this paper we prove that the problem is NP-Complete for caterpillars with hairs of length at most 2. In the positive side we give polynomial time algorithms for the problem in the cases, caterpillars with hairs of length at most 1 and any number of colors and caterpillars with hairs of length at most 2 and a constant number of colors. It is the first time a problem has been shown NP-complete for the particular case of caterpillars of hairs of length at most 2.19981998-02-0120162016-11-11reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/96513reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/965132026-05-27T15:37:01Z
dc.title.none.fl_str_mv Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
title Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
spellingShingle Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Colored graphs intervalizing
Caterpillars
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
title_full Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
title_fullStr Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
title_full_unstemmed Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
title_sort Intervalizing colored graphs is NP-complete for caterpilars with hair length 2
dc.creator.none.fl_str_mv Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Díaz Cort, Josep|||0000-0003-4422-0067
Serna Iglesias, María José|||0000-0001-9729-8648
author Álvarez Faura, M. del Carme|||0000-0003-2352-0546
author_facet Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Díaz Cort, Josep|||0000-0003-4422-0067
Serna Iglesias, María José|||0000-0001-9729-8648
author_role author
author2 Díaz Cort, Josep|||0000-0003-4422-0067
Serna Iglesias, María José|||0000-0001-9729-8648
author2_role author
author
dc.subject.none.fl_str_mv Colored graphs intervalizing
Caterpillars
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Colored graphs intervalizing
Caterpillars
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description The problem of Intervalizing Colored Graphs has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete for general graphs for kgeq 4 and has polynomial time algorithms for k=2 and k=3. In this paper we prove that the problem is NP-Complete for caterpillars with hairs of length at most 2. In the positive side we give polynomial time algorithms for the problem in the cases, caterpillars with hairs of length at most 1 and any number of colors and caterpillars with hairs of length at most 2 and a constant number of colors. It is the first time a problem has been shown NP-complete for the particular case of caterpillars of hairs of length at most 2.
publishDate 1998
dc.date.none.fl_str_mv 1998
1998-02-01
2016
2016-11-11
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/96513
url https://hdl.handle.net/2117/96513
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421604180590592
score 15,301603

Registros relacionados