Search for dissertations about: "graph problems"

Showing result 1 - 5 of 103 swedish dissertations containing the words graph problems.

  1. 1. Constructing Algorithms for Constraint Satisfaction and Related Problems Methods and Applications

    University dissertation from Institutionen för datavetenskap

    Author : Ola Angelsmark; Linköpings universitet.; Linköpings universitet.; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Abstract : 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. READ MORE

  2. 2. Order-preserving graph grammars

    University dissertation from Umeå : Umeå universitet, Institutionen för datavetenskap

    Author : Petter Ericson; Umeå universitet.; [2019]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Graph grammars; graph parsing; graph series; hyperedge replacement; uniform parsing problem; abstract meaning representation; semantic modelling; order preservation; reentrancy preservation; minimally adequate teacher; weighted graph grammars;

    Abstract : The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. READ MORE

  3. 3. On some graph coloring problems

    University dissertation from Umeå : Umeå universitet, Institutionen för matematik och matematisk statistik

    Author : Carl Johan Casselgren; Umeå universitet.; [2011]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; List coloring; interval edge coloring; coloring graphs from random lists; biregular graph; avoiding arrays; Latin square; scheduling; MATHEMATICS Algebra; geometry and mathematical analysis Discrete mathematics; MATEMATIK Algebra; geometri och analys Diskret matematik; Mathematics; matematik;

    Abstract : .... READ MORE

  4. 4. Graph Partitioning and Planted Partitions

    University dissertation from Umeå : Umeå universitet, Institutionen för matematik och matematisk statistik

    Author : Mikael Onsjö; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; planted partition; graph bisection; algorithms; graphs; graph partitioning; clustering;

    Abstract : 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. READ MORE

  5. 5. Inverse Problems for Graph Laplacians

    University dissertation from Marlena Nowaczyk

    Author : Marlena Nowaczyk; Lunds universitet.; Lund University.; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Spectral theory; Laplace operator; Trace formula; Quantum graphs;

    Abstract : This thesis is devoted to inverse spectral problems for Laplace operators on metric graphs, and it is based on the following papers: Paper I - P. Kurasov and M. Nowaczyk 2005 Inverse spectral problem for quantum graphs J. Phys. READ MORE