A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189)
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: A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity |
scientific article; zbMATH DE number 983932
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity |
scientific article; zbMATH DE number 983932 |
Statements
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (English)
0 references
27 February 1997
0 references
Maximal independent set
0 references
Hypergraph
0 references
Parallel algorithms
0 references
0 references
