Pages that link to "Item:Q1400887"
From MaRDI portal
The following pages link to A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest (Q1400887):
Displaying 5 items.
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Optimal randomized EREW PRAM algorithms for finding spanning forests (Q2731600) (← links)
- A randomized linear-time algorithm for finding minimum spanning trees (extended abstract) (Q2817593) (← links)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625) (← links)