On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223)
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: On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph |
scientific article |
Statements
On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (English)
0 references
28 June 1992
0 references
greedy algorithm
0 references
lexicographically first maximal independent set
0 references
