Blar i Department of Informatics på forfatter "Manne, Fredrik"

Viser treff 1-5 av 5

    • Approximation algorithms in combinatorial scientific computing 

      Pothen, Alex; Ferdous, SM; Manne, Fredrik (Journal article; Peer reviewed, 2019)
      We survey recent work on approximation algorithms for computing degreeconstrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of ...

    • Community Detection on the GPU 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino (Chapter; Peer reviewed, 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 ...

    • Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks 

      Langedal, Kenneth; Langguth, Johannes; Manne, Fredrik; Schroeder, Daniel Thilo (Journal article; Peer reviewed, 2022)
      Minimum weighted vertex cover is the NP-hard graph problem of choosing a subset of vertices incident to all edges such that the sum of the weights of the chosen vertices is minimum. Previous efforts for solving this in ...

    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Chapter; Peer reviewed, 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 ...

    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (Chapter; 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 ...