Mostra el registre d'ítem simple
The Hardness of intervalizing four colored caterpillars
| dc.contributor.author | Serna Iglesias, María José |
| dc.contributor.author | Díaz Iriberri, José |
| dc.contributor.author | Álvarez Faura, M. del Carme |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2016-03-16T16:51:18Z |
| dc.date.available | 2016-03-16T16:51:18Z |
| dc.date.issued | 1998-07-02 |
| dc.identifier.citation | Serna Iglesias, María José; Díaz Iriberri, José; Álvarez Faura, M. del Carme. "The Hardness of intervalizing four colored caterpillars". 1998. |
| dc.identifier.uri | http://hdl.handle.net/2117/84544 |
| dc.description.abstract | The problem of Intervalizing Colored Graphs (ICG) 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 k>3 and has polynomial time algorithms for k=2 and k=3. In this paper we show that the ICG problem is NP-complete when the graph is a caterpillar tree, colored with k=4 (or more) colors, strengthen the cases for which the problem remains difficult. |
| dc.format.extent | 11 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-98-45-R |
| dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| dc.subject.other | Intervalizing colored graphs |
| dc.subject.other | ICG |
| dc.subject.other | DNA |
| dc.subject.other | Mapping |
| dc.title | The Hardness of intervalizing four colored caterpillars |
| dc.type | External research report |
| dc.rights.access | Open Access |
| local.identifier.drac | 515071 |
| dc.description.version | Postprint (published version) |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]