Alicia Thorsen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Efficient parallel algorithms for problems such as maximum weighted matching are central to many areas of combinatorial scientific computing. Manne and Bisseling [13] presented a parallel approximation algorithm which is well suited to distributed memory computers. This algorithm is based on a distributed protocol due to Hoepman [9]. In the current paper, a(More)
  • 1