Sökning: "Sebastian Norlin"

Hittade 1 uppsats innehållade orden Sebastian Norlin.

  1. 1. Finding the Densest Common Subgraph with Linear Programming

    Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Alexander Reinthal; Anton T örnqvist; Arvid Andersson; Erik Norlander; Philip Stålhammar; Sebastian Norlin; [2016-11-15]
    Nyckelord :Linear Programming; Graph theory; Dense Subgraphs; Densest Common Subgraph;

    Sammanfattning : 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. LÄS MER