Search for dissertations about: "Roland Häggkvist"
Showing result 6 - 8 of 8 swedish dissertations containing the words Roland Häggkvist.
-
6. On random satisfiability and optimization problems
Abstract : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. READ MORE
-
7. On avoiding and completing colorings
Abstract : All of my papers are related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend φ to a proper edge coloring of G which avoids L? In Paper I, G is the d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and a list assignment L must satisfy certain sparsity conditions. READ MORE
-
8. How to do what you want to do when you can not do what you want : on avoiding and completing partial latin squares
Abstract : .... READ MORE