Sökning: "graph colouring"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden graph colouring.
1. Code Optimisation Techniques for Lazy Functional Languages
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
2. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
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
3. Relaxation in constraint satisfaction problems
Sammanfattning : .... LÄS MER
4. Limit Laws, Homogenizable Structures and Their Connections
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
5. Decorating trees grown in urns
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