Showing results 1 to 3 of 3
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Approximating biconnectivity in parallel Proceeding/Conference:Annual ACM Symposium on Parallel Algorithms and Architectures | 1995 | ||
Finding connected components in O(log n loglog n) time on the EREW PRAM Proceeding/Conference:Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 1993 | ||
On the parallel time complexity of undirected connectivity and minimum spanning trees Proceeding/Conference:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms | 1999 |