Viser treff 1-1 av 1

• Optimizing Approximate Weighted Matching on Nvidia Kepler K40 ﻿

(Conference object; Peer reviewed, 2018)
Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand ...