A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00040-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069194665 / rank | |||
Normal rank | |||
Revision as of 00:48, 20 March 2024
scientific article
| 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 |
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
