An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 |
scientific article |
Statements
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (English)
0 references
16 January 1993
0 references
parallel algorithms
0 references
computational complexity
0 references
maximal independent set
0 references
hypergraph
0 references
NC algorithm
0 references
0 references
