Sökning: "graph"

Visar resultat 1 - 5 av 447 avhandlingar innehållade ordet graph.

  1. 1. Order-preserving graph grammars

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Sebastian Maneth; Umeå universitet; []
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER

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

  4. 3. Graph-based Methods for Interactive Image Segmentation

    Författare :Filip Malmberg; Ingela Nyström; Ewert Bengtsson; Jayaram K. Udupa; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital image analysis; Interactive image segmentation; Fuzzy image segmentation; Image foresting transform; Graph labeling; Graph cuts; Computerized Image Processing; Datoriserad bildbehandling;

    Sammanfattning : The subject of digital image analysis deals with extracting relevant information from image data, stored in digital form in a computer. A fundamental problem in image analysis is image segmentation, i.e., the identification and separation of relevant objects and structures in an image. LÄS MER

  5. 4. On some graph coloring problems

    Författare :Carl Johan Casselgren; Roland Häggkvist; Svante Linusson; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; List coloring; interval edge coloring; coloring graphs from random lists; biregular graph; avoiding arrays; Latin square; scheduling; Discrete mathematics; Diskret matematik; Mathematics; matematik;

    Sammanfattning : .... LÄS MER

  7. 5. Graph Decomposition Using Node Labels

    Författare :Öjvind Johansson; KTH; []
    Nyckelord :graph decomposition; modular decomposition; cographs; NLC-width; clique-width;

    Sammanfattning : .... LÄS MER