Computational complexity of classical problems for hereditary clique-helly graphs
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Computational complexity of classical problems for hereditary clique-helly graphs
|
| Id. |
880434 |
| Idioma |
inglés
|
| Titulo |
Computational complexity of classical problems for hereditary clique-helly graphs |
| Autor(es) |
Bonomo,Flavia
Durán,Guillermo
|
| Localización |
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000300006
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-Helly when every induced subgraph of it is clique-Helly. The decision problems associated to the stability, chromatic, clique and clique-covering numbers are NP-complete for clique-Helly graphs. In this note, we analyze the complexity of these problems for hereditary clique-Helly graphs. Some of them can be deduced easily by known results. We prove that the clique-covering problem remains NP-complete for hereditary clique-Helly graphs. Furthermore, the decision problems associated to the clique-transversal and the clique-independence numbers are analyzed too. We prove that they remain NP-complete for a smaller class: hereditary clique-Helly split graphs.
|
| Tipo |
text/html
|
| Palabras clave |
computational complexity
|
| Tipo de recurso |
journal article
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Formatos |
text/html
|
| Requerimientos técnicos |
Browser: Any
|
| Fecha de contribución |
23-may-2005 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
