Pages that link to "Item:Q3489456"
From MaRDI portal
The following pages link to Probabilistic analysis of a parallel algorithm for finding maximal independent sets (Q3489456):
Displaying 12 items.
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- A processor efficient MIS algorithm on random graphs (Q1318767) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- A fine-grained analysis of a simple independent set algorithm (Q2920136) (← links)
- Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph (Q3123118) (← links)
- An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (Q3136616) (← links)
- Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
- Tight Analysis of Parallel Randomized Greedy MIS (Q3384660) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)
- On the Average Case Complexity of Some P-complete Problems (Q4256141) (← links)
- (Q4258251) (← links)
- A parallel algorithm for computing the critical independence number and related sets (Q5415703) (← links)