Sökning: "graph colouring"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden graph colouring.

  1. 1. Code Optimisation Techniques for Lazy Functional Languages

    Författare :Urban Boquist; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph reduction; garbage collection; lazy functional languages; program transformation; interprocedural register allocation; graph colouring; intermediate code; code optimisation; compiler back-end;

    Sammanfattning : This thesis describes a complete compiler back-end for lazy functional languages, which uses various interprocedural optimisations to produce highly optimised code. The most important contributions of this work are the following. LÄS MER

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

  4. 3. Relaxation in constraint satisfaction problems

    Författare :Pontus Svenson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computational complexity; spin glasses; graph colouring; NP-completeness; relaxation; boolean satisfiability;

    Sammanfattning : .... LÄS MER

  5. 4. Limit Laws, Homogenizable Structures and Their Connections

    Författare :Ove Ahlman; Vera Koponen; Dugald Macpherson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Model theory; random structure; finite model theory; simple theory; homogeneous structure; countably categorical; 0-1 law; Mathematical Logic; Matematisk logik; Mathematics; Matematik;

    Sammanfattning : This thesis is in the field of mathematical logic and especially model theory. The thesis contain six papers where the common theme is the Rado graph R. Some of the interesting abstract properties of R are that it is simple, homogeneous (and thus countably categorical), has SU-rank 1 and trivial dependence. LÄS MER

  7. 5. Decorating trees grown in urns

    Författare :Colin Desmarais; Cecilia Holmgren; Stanislav Volkov; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Random recursive trees are classic models of random trees. A random recursive tree is initiated with a single root vertex and constructed in steps, whereby at each step a vertex is added as the child of a vertex chosen uniformly at random in the tree. LÄS MER