Skip to Main content Skip to Navigation

Modèles et algorithmes pour les graphes dynamiques

Abstract : Graph problems have been widely studied in the case of static graphs. However, these graphs do not allow a time dimension to be considered, even though time is an important variable for the situations to model. Dynamic graphs make it possible to model evolution over time. This is a reason to wonder about graph problems in a dynamic context. First, it is necessary to define the most appropriate dynamic graphs model and the precise problem on those graphs. When the problem cannot be efficiently solved directly using known static graph methods, an algorithm specific to dynamic graphs must be designed and analyzed theoretically and practically.With that approach, this thesis' objective is to study graph problems' extensions to dynamic graphs. This works deals with several graph problems in a dynamic context by focusing on algorithmic aspects and without considering application domains.
Complete list of metadatas
Contributor : Abes Star :  Contact
Submitted on : Monday, November 30, 2020 - 11:47:07 AM
Last modification on : Tuesday, December 1, 2020 - 3:44:01 AM


Version validated by the jury (STAR)


  • HAL Id : tel-03030851, version 1


Mathilde Vernet. Modèles et algorithmes pour les graphes dynamiques. Algorithme et structure de données [cs.DS]. Normandie Université, 2020. Français. ⟨NNT : 2020NORMLH12⟩. ⟨tel-03030851⟩



Record views


Files downloads