Abstract
We present adaptive parallel algorithms for b — matchings in trees. The algorithms are designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a tree of n vertices, the algorithms run in O(n/p+log n) time using p processors (p≤n). When p≤n/(log n), the algorithms are cost optimal.
Ordinary matching problems are special cases of b — matching problems. The best previously known parallel algorithm for ordinary matching in trees runs in O(log n) time using O(n) processors on the EREW PRAM model. Our algorithms achieve the same time complexity with fewer processors.
This work was supported by the Natural Sciences and Engineering Research Council of Canada under grant A3336.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Aho, A.V., J.E. Hopcroft and J.D. Ullman, [1974], The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.
Akl, S.G., [1989], The Design and Analysis of Parallel Algorithms, Prentice Hall, Englewood Cliffs, New Jersey, 1989.
Akl, S.G., [1985], Parallel Sorting Algorithms, Academic Press, Orlando, Florida, 1985.
Akl, S.G., [1984], "An Optimal Algorithm for Parallel Selection", Information Processing Letters, Vol. 19, No. 1, 1984, pp. 47–50.
Berge, C. [1973], Graphs and Hypergraphs, (translated by E. Minieka) North-Holland, New York, New York, 1973.
Blum, M., R.W. Floyd, V. Pratt, R.L. Rivest and R.E. Tarjan, [1973], "Time Bounds for Selection", Journal of Computer and System Sciences, Vol. 7, 1973, pp. 448–461.
Bondy, J.A. and U.S.R. Murty, [1976], Graph Theory with Applications, North-Holland, New York, New York, 1976.
Brent, R.P., [1974], "The Parallel Evaluation of General Arithmetic Expressions", Journal of the Association for Computing Machinery, Vol. 21, No. 2, April 1974, pp. 201–206.
Cole, R. and U. Vishkin, [1988], "Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal List Ranking in Logarithmic Time", SIAM Journal on Computing, Vol. 17, No. 1, February 1988, pp. 128–142.
Cole, R. and U. Vishkin, [1986], "Approximate Parallel and Exact Parallel Scheduling with Applications to Lists, Tree and Graph Problems", Proceedings of the IEEE 27 th Symposium on Foundations of Computer Science, October 27–29, 1986, pp. 478–491.
Edmonds, J., [1965a], "Paths, Trees and Flowers", Canadian Journal of Mathematics Vol. 17, No. 3, 1965, pp. 449–467.
Edmonds, J., [1965b], "Matching and Polyhedrons with 0,1 Vertices", Journal of Research of the National Bureau of Standards B. Mathematics and Mathematical Physics Vol. 69B, Nos. 1 and 2, Jan.–June 1965, pp. 125–130.
Gabow, H.N., [1976], "An Efficient Implementation of Edmonds Algorithm for Maximal Matching on Graphs", Journal of the Association for Computing Machinery, Vol. 23, No. 2, April 1976, pp. 221–234.
Gabow, H.N., [1974], "Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs", Ph.D. Dissertation, Department of Computer Science, Stanford University, Stanford, California, 1974.
Goodman, S., S. Hedetniemi and R.E. Tarjan, [1976], "b-Matchings in Trees", SIAM Journal on Computing, Vol. 5, No. 1, March 1976, pp. 104–108.
He, X. and Y. Yesha, [1988], "Binary Algebraic Computation and Parallel Algorithms for Simple Graphs", Journal of Algorithms, Vol. 9, 1988, pp. 92–113.
Hyafil, L., [1976], "Bounds for Selection", SIAM Journal on Computing, Vol. 5, No. 1, March 1976, pp. 109–114.
Knuth, D.E., [1976], The Art of Computer Programming, Vol. I: Fundamental Algorithms. Addison-Wesley, Reading, Massachusetts, 1968.
Lawler, E.L. [1976], Combinatorial Optimization: Networks and Matroids, Holt-Rinehart-Winston, New York 1976.
Papadimitriou, C.H. and K Steiglitz, [1982], Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
Pawagi, S., [1987], "Parallel Algorithms for Maximum Weight Matching in Trees", Proceedings of the 1987 International Conference on Parallel Processing, Aug 12–21 1987, pp. 204–206.
Tarjan, R.E. and U. Vishkin, [1984], "Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)", Proceedings of the 25 th Annual IEEE Symposium on Foundation of Computer Science, IEEE, New York, 1984, pp. 12–20.
Tarjan, R.E. [1972], "Depth-First Search and Linear Graph Algorithms", SIAM Journal on Computing, Vol. 1, No. 2, June 1972, pp. 146–160.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osiakwan, C.N.K., Akl, S.G. (1989). Optimal parallel algorithms for b-matchings in trees. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive