Pages that link to "Item:Q1318767"
From MaRDI portal
The following pages link to A processor efficient MIS algorithm on random graphs (Q1318767):
Displaying 8 items.
- Distributed algorithms for random graphs (Q888436) (← links)
- A randomized NC algorithm for the maximal tree cover problem (Q1183479) (← links)
- Parallel graph algorithms that are efficients on average (Q1825648) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- 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 Simple Parallel Algorithm for the Maximal Independent Set Problem (Q3756533) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)