Alicia Thorsen

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)
A linear time approximation algorithm for the weighted matching problem is presented using the partitioned global address space model (PGAS). The problem of finding a maximum weight matching in a graph is central to many areas of combinatorial scientific computing. Even though the exact algorithm runs in polynomial time, a fast approximate solution is often(More)
  • 1