#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2009

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alicia Thorsen, Phillip Merkey, Fredrik Manne
- SpringSim
- 2009

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)

Even though the maximum weighted matching problem can be solved in polynomial time, there are many real world problems for which this is still too costly. As a result, there is a need for fast approximation algorithms for this problem. Manne and Bisseling presented a parallel greedy algorithm which is well suited to distributed memory computers. This paper… (More)

- Alicia Thorsen, Phillip Merkey, Fredrik Manne
- PGAS '09
- 2009

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
- ›