I. Parfenoff, "An Efficient Parallel Algorithm for Maximum Matching", Journal of Parallel and Distributed Computing, Vol. 52, No. 1, July 1998, pp. 96-108.  Home/Search   Document Not in Database   Summary   Related Articles

....in logarithmic parallel time, if applied to a cograph represented as a parse tree, by reducing them to instances of a B ATC or T ATC problem. Lin and Olariu [17] developed an optimal parallel matching algorithm for cographs, a result that was extended for some other classes of graphs by Parfenoff [18]. He [12] investigated the possibility of developing optimal parallel algorithms for another family of graphs: two terminal series parallel graphs. Using the already well established methodology based on tree contraction, He was able to construct linear cost parallel algorithms for solving three ....

I. Parfenoff, "An Efficient Parallel Algorithm for Maximum Matching", Journal of Parallel and Distributed Computing, Vol. 52, No. 1, July 1998, pp. 96-108.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC