An optimal algorithm for parallel selection
Information Processing Letters
Binary tree algebraic computation and parallel algorithms for simple graphs
Journal of Algorithms
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
A simple parallel tree contraction algorithm
Journal of Algorithms
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Graphs and Hypergraphs
Parallel tree contraction and its application
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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, we present an algorithm that determines a maximum cardinality b-matching in O(n/p + log n) time using p processors, where p = @/n/log n is also designed for the maximum weight b-matching problem in trees. When p =