Zobrazeno 1 - 10
of 399
pro vyhledávání: '"P. Lagoutte"'
Autor:
Beaudou, Laurent, Bergé, Pierre, Chernyshev, Vsevolod, Dailly, Antoine, Gerard, Yan, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas
We study the PSPACE-complete $k$-Canadian Traveller Problem, where a weighted graph $G=(V,E,\omega)$ with a source $s\in V$ and a target $t\in V$ are given. This problem also has a hidden input $E_* \subsetneq E$ of cardinality at most $k$ representi
Externí odkaz:
http://arxiv.org/abs/2403.01872
Publikováno v:
49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)
The goal of local certification is to locally convince the vertices of a graph $G$ that $G$ satisfies a given property. A prover assigns short certificates to the vertices of the graph, then the vertices are allowed to check their certificates and th
Externí odkaz:
http://arxiv.org/abs/2311.16953
Autor:
Lakshmi Balasubramaniam, Shreyansh Jain, Tien Dang, Emilie Lagoutte, René Marc Mège, Philippe Chavrier, Benoit Ladoux, Carine Rossé
Publikováno v:
Advanced Science, Vol 11, Iss 42, Pp n/a-n/a (2024)
Abstract In vertebrates, many organs, such as the kidney and the mammary gland form ductal structures based on the folding of epithelial sheets. The development of these organs relies on coordinated sorting of different cell lineages in both time and
Externí odkaz:
https://doaj.org/article/f6c0870daab348b3a10eb897b0fb4a6e
Autor:
Fabien Degalez, Mathieu Charles, Sylvain Foissac, Haijuan Zhou, Dailu Guan, Lingzhao Fang, Christophe Klopp, Coralie Allain, Laetitia Lagoutte, Frédéric Lecerf, Hervé Acloque, Elisabetta Giuffra, Frédérique Pitel, Sandrine Lagarrigue
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-18 (2024)
Abstract Gene atlases for livestock are steadily improving thanks to new genome assemblies and new expression data improving the gene annotation. However, gene content varies across databases due to differences in RNA sequencing data and bioinformati
Externí odkaz:
https://doaj.org/article/289590f9430a4752b5aaa9be20f46cfd
Autor:
Beaudou, Laurent, Brosse, Caroline, Defrain, Oscar, Foucaud, Florent, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Graph Theory (April 2, 2024) dmtcs:8715
The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm colours the vertic
Externí odkaz:
http://arxiv.org/abs/2110.14003
Autor:
Sandrine Vadon-Le Goff, Agnès Tessier, Manon Napoli, Cindy Dieryckx, Julien Bauer, Mélissa Dussoyer, Priscillia Lagoutte, Célian Peyronnel, Lucie Essayan, Svenja Kleiser, Nicole Tueni, Emmanuel Bettler, Natacha Mariano, Elisabeth Errazuriz-Cerda, Carole Fruchart Gaillard, Florence Ruggiero, Christoph Becker-Pauly, Jean-Marc Allain, Leena Bruckner-Tuderman, Alexander Nyström, Catherine Moali
Publikováno v:
Nature Communications, Vol 14, Iss 1, Pp 1-18 (2023)
Abstract BMP-1/tolloid-like proteinases (BTPs) are major players in tissue morphogenesis, growth and repair. They act by promoting the deposition of structural extracellular matrix proteins and by controlling the activity of matricellular proteins an
Externí odkaz:
https://doaj.org/article/b70ac49b3ff14e0dbe4cefec902c66e6
Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal edge colouring be reached from any given proper edge colouring through a series of Kempe changes? We answer this question in the affirmative for
Externí odkaz:
http://arxiv.org/abs/2107.07900
Autor:
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Graph Theory (2024)
The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm colours the vertic
Externí odkaz:
https://doaj.org/article/a885163b95d94d1d87168b84ee0b63b8
In this paper, we are interested in algorithms that take in input an arbitrary graph $G$, and that enumerate in output all the (inclusion-wise) maximal "subgraphs" of $G$ which fulfil a given property $\Pi$. All over this paper, we study several diff
Externí odkaz:
http://arxiv.org/abs/2007.01031
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.