Loading...
Please wait, while we are loading the content...
Similar Documents
A parallel approximation algorithm for the weighted maximum matching problem (2007)
| Content Provider | CiteSeerX |
|---|---|
| Author | Manne, Fredrik |
| Description | In Proc. Seventh Int. Conf. on Parallel Processing and Applied Mathematics (PPAM |
| Abstract | We consider the problem of computing a matching in a large weighted graph using a parallel algorithm. Since an exact algorithm for the weighted matching problem is fairly costly we instead develop a fast approximation algorithm. The parallel algorithm is based on a distributed algorithm due to Hoepman [6]. Through experiments using both complete as well as sparse graphs we show that our new algorithm scales well using up to 32 processors. 1 |
| File Format | |
| Publisher Date | 2007-01-01 |
| Access Restriction | Open |
| Subject Keyword | Parallel Algorithm Fast Approximation Algorithm Distributed Algorithm Large Weighted Graph Sparse Graph Exact Algorithm Weighted Matching Problem Parallel Approximation Algorithm New Algorithm Scale Weighted Maximum Matching Problem |
| Content Type | Text |
