Search for dissertations about: "Graph Theory"
Showing result 1  5 of 119 swedish dissertations containing the words Graph Theory.

1. Discrete Methods used in Graph Theory and Linear Programming
University dissertation from Centre for Mathematical Sciences, Lund UniversityAbstract : The content of the thesis is divided into two parts; graph theory and linear programming. The main results in the first part concerns extremal graph theory. Here we want to determine the number of edges in a graph needed to ensure the existence of certain local structures. READ MORE

2. Topics on Game Theory
University dissertation from Chalmers University of TechnologyAbstract : .... READ MORE

3. Random geometric graphs and their applications in neuronal modelling
University dissertation from Lund University, Faculty of Science, Centre for Mathematical SciencesAbstract : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. READ MORE

4. Optimal Decisions with Limited Information
University dissertation from Department of Automatic Control, Lund Institute of Technology, Lund UniversityAbstract : This thesis considers static and dynamic team decision problems in both stochastic and deterministic settings. The team problem is a cooperative game, where a number of players make up a team that tries to optimize a given cost induced by the uncertainty of nature. READ MORE

5. Optimal and Hereditarily Optimal Realizations of Metric Spaces
University dissertation from Uppsala : Matematiska institutionenAbstract : This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies the problem of finding an optimal realization of a given finite metric space: a weighted graph which preserves the metric's distances and has minimal total edge weight. This problem is known to be NPhard, and solutions are not necessarily unique. READ MORE