Un algoritmo paralelo para el problema del conjunto independiente
Kaydedildi:
| Yazarlar: | , |
|---|---|
| Materyal Türü: | artículo original |
| Durum: | Versión publicada |
| Yayın Tarihi: | 2000 |
| Diğer Bilgiler: | 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. |
| Ülke: | Portal de Revistas UCR |
| Kurum: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Dil: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/185 |
| Online Erişim: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/185 |
| Anahtar Kelime: | Graph Independent Set Independence Number Stability Number Parallel Algorithm Gráfica Conjunto Independiente Número de Independencia Número de Estabilidad Algoritmo Paralelo |