Abstract
We introduce pruning decomposition, a new method of graph decom position which is very useful in developing a parallel algorithm for graph problems on EREW P-RAM. We present parallel algorithms that achieve the decomposition and an parallel algorithm for finding biconnected components of graphs based on the pruning decomposition. The complexity for both algorithms on EREW P-RAM is dominated by the spanning tree construction.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, N. Dadoun, D. Kirkpatrick, and T. Prsytycka, ”A simple Parallel Tree Construction Algorithm,” Journal of Algorithms, 10, pp.287–302, 1989.
K. W. Chong and T. W. Lam, ”Finding Connected Components in O(lognloglogn) Time on the EREW PRAM,” SODA, 1993.
R. Cole and U. Vishkin, ”Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking,” AWOC pp.91–100, 1988.
E. Dekel and J. Hu, ”A Parallel Algorithm for Finding Minimum Cutsets in Reduceble graphs,” Journal of Parallel and Distributed Processing, to appear.
S. Ntafos, E. Dekel and S. Peng, ”Compression Trees and Their Applications,” Proc. ICPP, pp.132–139, 1987.
J. Hu, ”Parallel Algorithms for Distributed Systems and Software Engineering,” Ph. D. Dissertation, University of Texas at Dallas, 1992.
D. Knuth, ”The Art of Computer Programming. Vol. 1. Fundamental Algorithms,” Addison-Wesley, Reading, MA, 1968.
R. M. Karp and V. Ramachandran, ”A Survey of Parallel Algorithms for Shared-Memory Machines,” Handbook of Theoretical Computer Science, Cambridge, MIT Press, 1990.
Y. Maon, B. Schieber and U. Vishkin, ”Parallel Ear Decomposition Search and st-Numbering in Graphs,” Theo. Com. Sci., Vol.47, pp.277–298, 1986.
D. Nath and S.N. Maheshwari, ”Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems,” Inf. Proc. Lett., Vol 14, No.l,pp.7–11, 1982.
Y. H. Tsin and F. Y. Chin, ” Efficient Parallel Algorithms for a Class of Graph Theoretic Problems,” SIAM J. Comput. Vol.13, No.3, pp.580–599, 1984.
R. E. Tarjan and U. Vishkin, ”An Efficient Parallel Biconnectivity Algorithm,” SIAM J.Comput., Vol.14, No.4, 862–874, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dekel, E., Hu, J. (1994). Parallel pruning decomposition (PDS) and biconnected components of graphs. In: Bonuccelli, M., Crescenzi, P., Petreschi, R. (eds) Algorithms and Complexity. CIAC 1994. Lecture Notes in Computer Science, vol 778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57811-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-57811-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57811-6
Online ISBN: 978-3-540-48337-3
eBook Packages: Springer Book Archive