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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
