On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph
| Image |  |
|---|---|
| Description | scholarly article by Neil J. Calkin et al published 1992 in Random Structures and Algorithms |
| Author/s | |
| Publication date | 1992 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |