Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Chapelle, Mathieu"'
Autor:
Chapelle, Mathieu
Les décompositions de graphes, lorsqu’elles sont de petite largeur, sont souvent utilisées pour résoudre plus efficacement des problèmes étant difficiles dans le cas de graphes quelconques. Dans ce travail de thèse, nous nous intéressons aux
Externí odkaz:
http://www.theses.fr/2011ORLE2057/document
In the context of abstract geometrical computation, computing with colored line segments, we study the possibility of having an accumulation with small signal machines, ie, signal machines having only a very limited number of distinct speeds. The cas
Externí odkaz:
http://arxiv.org/abs/1307.6468
After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex C
Externí odkaz:
http://arxiv.org/abs/1305.0433
Autor:
Chapelle, Mathieu
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\sigma,\rho]$-Dominating Set}) problem
Externí odkaz:
http://arxiv.org/abs/1004.2642
Publikováno v:
In Journal of Computer and System Sciences November 2018 97:182-198
Autor:
Chapelle, Mathieu, Cochefert, Manfred, Couturier, Jean-Fraņcois, Kratsch, Dieter, Letourneur, Romain, Liedloff, Mathieu, Perez, Anthony
Publikováno v:
In Discrete Applied Mathematics 30 October 2018 248:79-92
Autor:
Chapelle, Mathieu, Cochefert, Manfred, Kratsch, Dieter, Letourneur, Romain, Liedloff, Mathieu
Publikováno v:
In Theoretical Computer Science 9 May 2017 676:33-41
Publikováno v:
In Discrete Applied Mathematics 10 January 2017 216 Part 1:114-129
Autor:
Chapelle, Mathieu
unpublished; The concept of generalized domination unifies well-known variants of domination-like problems. A generalized domination (also called [Sigma,Rho]-Dominating Set}) problem consists in finding a dominating set for which every vertex of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0681119b6685314cf35a1fcdcdcc6753
https://hal.archives-ouvertes.fr/hal-00515882
https://hal.archives-ouvertes.fr/hal-00515882
Autor:
Chapelle, Mathieu
Publikováno v:
Complexité [cs.CC]. Université d'Orléans, 2011. Français
Graphs decompositions of small width are usually used to solve efficiently problems which are difficult in general. In this thesis, we focus on some limits of these decompositions, and the construction of some obstructions certifying a large width. F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::65e3c3eab846938f5c614757e238face
https://tel.archives-ouvertes.fr/tel-00659666
https://tel.archives-ouvertes.fr/tel-00659666