• A new approach for finding communities of edges in complex networks 

      Movik, Morten (Master thesis, 2019-11)
      Discovering dense subparts, called communities, in complex networks is a fundamental issue in data analysis. A popular way to do this is to create a partition of the network. This partition can either be a partition of ...
    • Overlapping Community Detection using Cluster Editing with Vertex Splitting 

      Askeland, Gard (Master thesis, 2022-11-21)
      The problem Cluster Editing with Vertex Splitting models the task of overlapping community detection by yielding a cluster graph wherein a vertex of the input graph may be split so that it is present in several clusters. ...
    • Parallel Community Detection in Incremental Graphs 

      Tønnessen, Magnus (Master thesis, 2023-06-02)
      The problem of community detection in large, expanding real-world networks presents significant challenges due to the scale and complexity of these networks. Traditional algorithms struggle to provide optimal solutions or ...