Add to ORKGIn this thesis we give the first parallel GPU-implementation of the ROMA algorithm suited for complete graphs. ROMA is an approximation algorithm solving the maximum weighted matching problem. Our algorithm achieves an average speedup of 207 on our input graphs when comparing it to the sequential algorithm, while still giving equally good matchings
Modern Graphics Processing Units (GPUs) provide high computation power at low costs and have been de...
In our work we present two parallel algorithms and their lock-free im-plementations using a popular ...
This paper presents an O(log log d¯) round massively parallel algorithm for 1 + ? approximation of m...
In this thesis we give the first parallel GPU-implementation of the ROMA algorithm suited for comple...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Dire...
We consider the problem of computing a weighted edge matching in a large graph using a parallel algo...
Matching is a fundamental graph problem with numerous applications in science and engineering. While...
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to...
Parallel graph algorithm design is a very well studied topic. Many results have been presented for t...
[[abstract]]Graphics processing units (GPUs) have attracted a lot of attention due to their cost-eff...
We design a family of parallel algorithms and GPU implementations for the exact string matching prob...
A new algorithm for finding a maximum matching in a general graph is presented; its special feature ...
AbstractApproximate string matching is one of the most important technologies in the field of comput...
Stefanes MA, Rubert D, Soares J. Scalable parallel algorithms for maximum matching and Hamiltonian c...
Modern Graphics Processing Units (GPUs) provide high computation power at low costs and have been de...
In our work we present two parallel algorithms and their lock-free im-plementations using a popular ...
This paper presents an O(log log d¯) round massively parallel algorithm for 1 + ? approximation of m...
In this thesis we give the first parallel GPU-implementation of the ROMA algorithm suited for comple...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Dire...
We consider the problem of computing a weighted edge matching in a large graph using a parallel algo...
Matching is a fundamental graph problem with numerous applications in science and engineering. While...
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to...
Parallel graph algorithm design is a very well studied topic. Many results have been presented for t...
[[abstract]]Graphics processing units (GPUs) have attracted a lot of attention due to their cost-eff...
We design a family of parallel algorithms and GPU implementations for the exact string matching prob...
A new algorithm for finding a maximum matching in a general graph is presented; its special feature ...
AbstractApproximate string matching is one of the most important technologies in the field of comput...
Stefanes MA, Rubert D, Soares J. Scalable parallel algorithms for maximum matching and Hamiltonian c...
Modern Graphics Processing Units (GPUs) provide high computation power at low costs and have been de...
In our work we present two parallel algorithms and their lock-free im-plementations using a popular ...
This paper presents an O(log log d¯) round massively parallel algorithm for 1 + ? approximation of m...