ISAAC 1998: Algorithms and Computation pp 447-457 | Cite as
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
Conference paper
First Online:
Abstract
We present an efficient NC algorithm for finding a sparse k-edge-connectivity certificate of a multigraph G. Our algorithm runs in O((log kn)(log k)2(log n)2) time using O(k(n + m′)) processors on an ARBITRARY CRCW PRAM, where n and m' stand for the numbers of vertices in G and edges in the simplified graph of G, respectively.
Preview
Unable to display preview. Download preview PDF.
References
- 1.J. Cheriyan, M.Y. Kao, and R. Thurimella, Scan-first search and sparse certificates An improved parallel algorithm for k-vertex connectivity, SIAM J. Comput. 221993157–174.MATHCrossRefMathSciNetGoogle Scholar
- 2.T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms (The MIT Press, Cambridge MA1990Google Scholar
- 3.A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matchingInform. Process. Lett. 22 1986 57–60MATHCrossRefMathSciNetGoogle Scholar
- 4.J. JáJá, An Introduction to Parallel Algorithms (Addison-Wesley, Reading MA1992MATHGoogle Scholar
- 5.D.R. Karger and R. Motwani, An NC algorithm for minimum cutsSIAM J. Comput.261997)255–272.MATHCrossRefMathSciNetGoogle Scholar
- 6.R.M. Karp and V. Ramachandran, Parallel algorithms for shared memory machines in J. van Leeuwen Ed Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam 1990)869–941Google Scholar
- 7.D.W. Matula, A linear time 2 + e approximation algorithm for edge connectivity, in:Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms1993500–504Google Scholar
- 8.H. Nagamochi and T. Ibaraki, A linear-time algorithm for finding a sparse k- connected spanning subgraph of a k-connected graph, Algorithmica 7 1992 583–596CrossRefMathSciNetMATHGoogle Scholar
- 9.H. Nagamochi and T. Ibaraki, Computing edge-connectivity of multigraphs and capacitated graphsSIAM J. Disc. Math.51992 54–66MATHCrossRefMathSciNetGoogle Scholar
- 10.Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm J.of Algorithms 3 1982 57–67.MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1998