Avancerad sökning
Hittade 1 uppsats som matchar ovanstående sökkriterier.
1. Finding the Densest Common Subgraph with Linear Programming
Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : 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
Resultatsidor:
1