Pages that link to "Item:Q3123118"
From MaRDI portal
The following pages link to Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph (Q3123118):
Displaying 7 items.
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
- Tight Analysis of Parallel Randomized Greedy MIS (Q3384660) (← links)
- Probabilistic analysis of a parallel algorithm for finding maximal independent sets (Q3489456) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005) (← links)
- A parallel algorithm for computing the critical independence number and related sets (Q5415703) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)