Un algoritmo paralelo para el problema del conjunto independiente
Guardado en:
| Autores: | , |
|---|---|
| Formáid: | artículo original |
| Stádas: | Versión publicada |
| Fecha de Publicación: | 2000 |
| Cur Síos: | A set S of vertices in a graph G is independent if there does not exist two adjacent vertices in S, that is, the subgraph of G induced by S does not have edges. In this work we present a parallel algorithm that permits to obtain all maximal independent sets in a graph. We present the foundations of the algorithm and some properties. |
| País: | Portal de Revistas UCR |
| Institiúid: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Teanga: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/185 |
| Rochtain Ar Líne: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/185 |
| Palabra clave: | Graph Independent Set Independence Number Stability Number Parallel Algorithm Gráfica Conjunto Independiente Número de Independencia Número de Estabilidad Algoritmo Paralelo |