Now showing items 1-1 of 1

    • Finding the Densest Common Subgraph with Linear Programming 

      Reinthal, Alexander; T örnqvist, Anton; Andersson, Arvid; Norlander, Erik; Stålhammar, Philip; Norlin, Sebastian (2016-11-15)
      This thesis studies the concept of dense subgraphs, speci cally for graphs with multiple edge sets. Our work improves the running time of an existing Linear Program (LP) for solving the Densest Common Subgraph problem. ...