Un algoritmo paralelo para el problema del conjunto independiente
保存先:
| 著者: | , |
|---|---|
| フォーマット: | artículo original |
| 状態: | Versión publicada |
| 出版日付: | 2000 |
| その他の書誌記述: | 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. |
| 国: | Portal de Revistas UCR |
| 機関: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 言語: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/185 |
| オンライン･アクセス: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/185 |
| キーワード: | Graph Independent Set Independence Number Stability Number Parallel Algorithm Gráfica Conjunto Independiente Número de Independencia Número de Estabilidad Algoritmo Paralelo |