Sökning: "Graph partitioning"

Visar resultat 11 - 15 av 18 uppsatser innehållade orden Graph partitioning.

  1. 11. Measuring the extent of interdisciplinary research and creating a collaboration group structure at KTH

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Agnes Åman; Hanna Nyblom; [2016]
    Nyckelord :;

    Sammanfattning : With interdisciplinary research being a possibility in modern research environ- ments, it is interesting to optimise collaborations between researchers in order to further develop the research environment. The scope of this thesis was therefore to develop a method to measure how widespread the interdisciplinary research is and to propose collaboration groups of researchers created by the use of graph theory. LÄS MER

  3. 12. Distributed balanced edge-cut partitioning of large graphs having weighted vertices

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

    Författare :Johan Elander Aman; [2015]
    Nyckelord :;

    Sammanfattning : Large scale graphs are sometimes too big to store and process on a single machine. Instead, these graphs have to be divided into smaller parts and distributed over several machines, while minimizing the dependency between the different parts. This is known as the graph partitioning problem, which has been shown to be NP-complete. LÄS MER

  4. 13. 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

  5. 14. Investigation of Power Grid Islanding Based on Nonlinear Koopman Modes

    Uppsats för yrkesexamina på avancerad nivå, KTH/Elektriska energisystem

    Författare :Fredrik Raak; [2013]
    Nyckelord :controlled islanding; grid partitioning; power system monitoring; Koopman mode analysis; spectral graph theory;

    Sammanfattning : To view the electricity supply in our society as just sockets mountedin our walls with a constant voltage output is far from the truth. Inreality, the power system supplying the electricity or the grid, is themost complex man-made dynamical system there is. It demands severecontrol and safety measures to ensure a reliable supply of electric power. LÄS MER

  7. 15. Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning

    Magister-uppsats, Beräkningsvetenskap

    Författare :Martin Fagerlund; [2010]
    Nyckelord :Cheeger inequality; Fiedler value; Fiedler vector; Graph partitioning; Normalised Laplacian; Semantic mirror; Word senses.;

    Sammanfattning : In this thesis we use the method of Semantic Mirrors to create a graph of words that are semantically related to a seed word. Spectral graph partitioning methods are then used to partition the graph into subgraphs, and thus dividing the words into different word senses. LÄS MER