Now showing items 1-4 of 4

    • Community Detection on the GPU 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino (IEEE, 2017)
      We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune ...
      Conference object
    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (SIAM, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...
      Conference object
    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (IEEE, 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 ...
      Conference object
    • Parallel Matching and Clustering Algorithms on GPUs 

      Naim, Md. (The University of Bergen, 2017-06-17)
      Doctoral thesis