Some problems in graph theory and graphs algorithmic theory - TEL - Thèses en ligne
[go: up one dir, main page]

Hdr Année : 2012
Some problems in graph theory and graphs algorithmic theory
1 ALGCO - Algorithmes, Graphes et Combinatoire (LIRMM, 161 rue Ada, 34000 Montpellier - France)
"> ALGCO - Algorithmes, Graphes et Combinatoire
Stéphane Bessy

Résumé

This document is a long abstract of my research work, concerning graph theory and algorithms on graphs. It summarizes some results, gives ideas of the proof for some of them and presents the context of the different topics together with some interesting open questions connected to them The first part precises the notations used in the rest of the paper; the second part deals with some problems on cycles in digraphs; the third part is an overview of two graph coloring problems and one problem on structures in colored graphs; finally the fourth part focus on some results in algorithmic graph theory, mainly in parametrized complexity.
Fichier principal
Vignette du fichier
hdr.pdf (2.19 Mo) Télécharger le fichier

Dates et versions

tel-00806716 , version 1 (02-04-2013)
Identifiants
  • HAL Id : tel-00806716 , version 1

Citer

Stéphane Bessy. Some problems in graph theory and graphs algorithmic theory. Discrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012. ⟨tel-00806716⟩
470 Consultations
5101 Téléchargements

Partager

More