Pages that link to "Item:Q3990223"
From MaRDI portal
The following pages link to On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223):
Displaying 4 items.
- Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph (Q3123118) (← links)
- Probabilistic analysis of a parallel algorithm for finding maximal independent sets (Q3489456) (← links)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)