Sökning: "graph partitioning"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden graph partitioning.

  1. 1. Graph Partitioning and Planted Partitions

    Författare :Mikael Onsjö; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; planted partition; graph bisection; algorithms; graphs; graph partitioning; clustering;

    Sammanfattning : Graph partitioning is the problem of splitting a graph into two or morepartitions of fixed sizes while minimizing the number of edges that are “cut”.This is an important problem with a wide range of applications in fields suchas VLSI design, parallel processing, bioinformatics, data mining etc. LÄS MER

  3. 2. Exact and approximation algorithms for graph problems with some biological applications

    Författare :Eva-Marta Lundell; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

    Sammanfattning : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. LÄS MER

  4. 3. Scalable Streaming Graph and Time Series Analysis Using Partitioning and Machine Learning

    Författare :Zainab Abbas; Vladimir Vlassov; Peter Van Roy; Paris Carbone; Vasiliki Kalavri; Vincenzo Massimiliano Gulisano; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Stream processing; graph processing; time series; big data; machine learning; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Recent years have witnessed a massive increase in the amount of data generated by the Internet of Things (IoT) and social media. Processing huge amounts of this data poses non-trivial challenges in terms of the hardware and performance requirements of modern-day applications. LÄS MER

  5. 4. Methods and Algorithms for Data-Intensive Computing : Streams, Graphs, and Geo-Distribution

    Författare :Hooman Peiro Sajjad; Vladimir Vlassov; Keijo Heljanko; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; stream processing; geo-distributed infrastructure; edge computing; streaming graph; dynamic graph; Informations- och kommunikationsteknik; Information and Communication Technology; Datalogi; Computer Science;

    Sammanfattning : Struggling with the volume and velocity of Big Data has attracted lots of interest towards stream processing paradigm, a paradigm in the area of data-intensive computing that provides methods and solutions to process data in motion. Today's Big Data includes geo-distributed data sources. LÄS MER

  7. 5. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

    Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

    Sammanfattning : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. LÄS MER