Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Graph colouring"”.
-
Mobile small cell networks for next generation wireless communication systems
… a classical optimisation solution, a heuristic graph colouring solution is then presented. Next, the model is extended for mobile small cells with random mobility. In addition, an optimisation and meta-heuristic solution is presented to cater for the need of mobile users moving at pedestrian …
-
Graph kernel extensions and experiments with application to molecule classification, lead hopping and multiple targets
… domains and have been recently adapted for graph structures making them directly applicable to pharmaceutical drug discovery. Specifically graph structures have a natural fit with molecular data, in that a graph consists of a set of nodes that represent atoms that are connected by bonds. In …
-
Descriptive complexity of constraint problems
… problems can be expressed. Examples include graph colouring problems, Boolean satisfaction, graph cut problems, systems of equations, and many more. One typically distinguishes between constraint satisfaction problems (CSPs), which model strictly decision problems, and so-called valued …
-
Results in Ramsey theory and extremal graph theory
… lower bounds on a certain quantity relating to graphs. The first problem is in Ramsey theory, while the others are in extremal graph theory. In Chapter 2, which is joint work with Vojtěch Dvořák, we consider the Ramsey number $R(F_n)$ of the fan graph $F_n$, a graph consisting of $n$ triangles …
-
Modifying landscapes with penalties in iterative improvement for solving distributed constraint satisfaction problems.
… satisfaction problems including distributed graph colouring, distributed Boolean satisfiability, and random DisCSPs. We also compared them to state-of-the-art distributed iterative improvement algorithms. The results of the evaluations show that the penalty driven algorithms are effective …
-
The Chromatic Structure of Dense Graphs
This thesis focusses on extremal graph theory, the study of how local constraints on a graph affect its macroscopic structure. We primarily consider the chromatic structure: whether a graph has or is close to having some (low) chromatic number. Chapter 2 is the slight exception. We consider an …