An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3138895 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Parallel Algorithm for the Maximal Independent Set Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing a Maximal Independent Set in Parallel / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385522 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of parallel search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank | |||
Normal rank | |||
Latest revision as of 15:35, 16 May 2024
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
