Ph.D
Group : Graphs, ALgorithms and Combinatorics
A few algorithmic and complexity problems in graph theory
Starts on 01/10/2013
Advisor : MANOUSSAKIS, Yannis
Funding : Aucun financement
Affiliation : Université Paris-Saclay
Laboratory : LRI - GALaC
Defended on 01/03/2017, committee :
Research activities :
Abstract :
This thesis is about graph theory. Formally, a graph is a set of vertices and a set of edges, which are pair of vertices, linking vertices. This thesis deals with various decision problem linked to the notion of graph, and, for each of these problem, try to find its complexity class, or to give an algorithm.
The first chapter is about the problem of finding the smallest connected tropical subgraph of a vertex-colored graph, which is the smallest connecter subgraph containing every colors.
The second chapter is about problems of tropical homomorphism, a generalisation of coloring problem. A link between these problems and several other class of homomorphism problems can be found in this chapter, especially with the class of Constraint Satisfaction Problem.
The third chapter is about two variant of the domination problem, namely the global alliance problems in a weighted graph and the safe set problem.
The fourth chapter is about the problem of finding a star tree-decomposition, which is a tree-decomposition where the radius of bags is 1.
Finally, the fifth chapter is about a variant of the problem of deciding the asymptotic behavior of the iterated biclique graph.