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 the normal view instead:
scientific article; zbMATH DE number 92136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 |
scientific article; zbMATH DE number 92136 |
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
0.8453157544136047
0 references
0.8402213454246521
0 references
0.8245460987091064
0 references
0.8233613967895508
0 references
0.8218453526496887
0 references
