scientific article; zbMATH DE number 871942
From MaRDI portal
Publication:4875217
zbMATH Open0847.68077MaRDI QIDQ4875217FDOQ4875217
Authors: Shay Halperin, Uri Zwick 
Publication date: 28 April 1996
Title of this publication is not available (Why is that?)
Recommendations
- Optimal randomized EREW PRAM algorithms for finding spanning forests
- A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
- An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (6)
- Title not available (Why is that?)
- A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- Optimal randomized EREW PRAM algorithms for finding spanning forests
- Computation of approximate polynomial GCDs and an extension
- The Complexity of Acyclic Subhypergraph Problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875217)
