Sökning: "Dense Subgraphs"

Hittade 4 uppsatser innehållade orden Dense Subgraphs.

  1. 1. Constructing and representing a knowledge graph(KG) for Positive Energy Districts (PEDs)

    Master-uppsats, Högskolan Dalarna/Institutionen för information och teknik

    Författare :Mahtab Davari; [2023]
    Nyckelord :Knowledge graph; Positive Energy Districts PEDs ; longest path; Questions and Answers; Community Detection; Node Embedding; t-SNE plots; Edge Prediction;

    Sammanfattning : In recent years, knowledge graphs(KGs) have become essential tools for visualizing concepts and retrieving contextual information. However, constructing KGs for new and specialized domains like Positive Energy Districts (PEDs) presents unique challenges, particularly when dealing with unstructured texts and ambiguous concepts from academic articles. LÄS MER

  3. 2. 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

  4. 3. Accelerating graph isomorphismqueries in a graph database usingthe GPU

    Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Simon Evertsson; [2016]
    Nyckelord :;

    Sammanfattning : Over the last decade the popularity of utilizing the parallel nature of thegraphical processing unit in general purpose problems has grown a lot. TodayGPUs are used in many different fields where one of them is the accelerationof database systems. Graph databases are a kind of database systems that havegained popularity in recent years. LÄS MER

  5. 4. Distributed Graph Clustering: Study of DiDiC and Some Simpler Forms

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Sahar Fallahtoori; [2015]
    Nyckelord :;

    Sammanfattning : The size of global electronic data in need of storage and retrieval is growing with an increasing rate. As a result of this growth, the development of technologies to process such data is a necessity. The data is developing in both complexity and connectivity, particularly for social networks. LÄS MER