Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Delbot, François"'
A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size at most $
Externí odkaz:
http://arxiv.org/abs/2304.09701
Publikováno v:
In Theoretical Computer Science 27 June 2024 1001
Given a graph $G$ and a non trivial partition $(V_1,V_2)$ of its vertex-set, the satisfaction of a vertex $v\in V_i$ is the ratio between the size of it's closed neighborhood in $V_i$ and the size of its closed neighborhood in $G$. The worst ratio ov
Externí odkaz:
http://arxiv.org/abs/2007.12434
Given a graph $G=(V,E)$, $S\subseteq V$ is a dominating set if every $v\in V\setminus S$ is adjacent to an element of $S$. The Minimum Dominating Set problem asks for a dominating set with minimum cardinality. It is well known that its decision versi
Externí odkaz:
http://arxiv.org/abs/2002.12232
We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal, claw-free, tri
Externí odkaz:
http://arxiv.org/abs/1909.02843
Publikováno v:
In Discrete Applied Mathematics 15 January 2021 288:9-19
Autor:
Delbot, François
La théorie de la complexité distingue les problèmes que l'on sait résoudre en un temps polynomial en la taille des données (que l'on peut qualifier de raisonnable), des problèmes NP-complets, qui nécessitent (en l'état actuel des connaissance
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00927315
http://tel.archives-ouvertes.fr/docs/00/92/73/15/PDF/MemoireDeThese_Delbot.pdf
http://tel.archives-ouvertes.fr/docs/00/92/73/15/PDF/MemoireDeThese_Delbot.pdf
In many wireless networks, there is no fixed physical backbone nor centralized network management. The nodes of such a network have to self-organize in order to maintain a virtual backbone used to route messages. Moreover, any node of the network can
Externí odkaz:
http://arxiv.org/abs/1408.2116
Autor:
Grollemund, Vincent, Le Chat, Gaétan, Secchi-Buhour, Marie-Sonia, Delbot, François, Pradat-Peyre, Jean-François, Bede, Peter, Pradat, Pierre-François
Publikováno v:
Journal of Neurology
Journal of Neurology, Springer Verlag, 2020, 268 (3), pp.825-850. ⟨10.1007/s00415-020-10181-2⟩
Journal of Neurology, 2021, 268 (3), pp.825-850. ⟨10.1007/s00415-020-10181-2⟩
Journal of Neurology, Springer Verlag, 2020, 268 (3), pp.825-850. ⟨10.1007/s00415-020-10181-2⟩
Journal of Neurology, 2021, 268 (3), pp.825-850. ⟨10.1007/s00415-020-10181-2⟩
International audience; Amyotrophic lateral sclerosis (ALS) is an inexorably progressive neurodegenerative condition with no effective diseasemodifying therapy at present. Given the striking clinical heterogeneity of the condition, the development an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c43c8f3da573d6b59d1af3e01d864b08
https://hal.archives-ouvertes.fr/hal-03401779/file/Manifold_learning_for_amyotrophic_lateral_sclerosi(1).pdf
https://hal.archives-ouvertes.fr/hal-03401779/file/Manifold_learning_for_amyotrophic_lateral_sclerosi(1).pdf