Zobrazeno 1 - 10
of 358
pro vyhledávání: '"Beaudou, A."'
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
We say that a signed graph is $k$-critical if it is not $k$-colorable but every one of its proper subgraphs is $k$-colorable. Using the definition of colorability due to Naserasr, Wang, and Zhu that extends the notion of circular colorability, we pro
Externí odkaz:
http://arxiv.org/abs/2309.04450
A graph database is a digraph whose arcs are labeled with symbols from a fixed alphabet. A regular graph pattern (RGP) is a digraph whose edges are labeled with regular expressions over the alphabet. RGPs model navigational queries for graph database
Externí odkaz:
http://arxiv.org/abs/2305.07271
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
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
A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chv\'atal conjectured in 2008 that a similar result can be achieved in the broader context of finite metric spaces. This conjecture remains open ev
Externí odkaz:
http://arxiv.org/abs/2005.09447
Autor:
Benoît, Aurélien, Husakou, Anton, Beaudou, Benoît, Debord, Benoît, Gérôme, Frédéric, Benabid, Fetah
Publikováno v:
Phys. Rev. Research 2, 023025 (2020)
We report on experimental and theoretical demonstration of an optical comb spectrum based on a combination of cascaded stimulated Raman scattering and four-wave mixing mediated by Raman-induced nonresonant Kerr-type nonlinearity. This combination ena
Externí odkaz:
http://arxiv.org/abs/1910.00841
Publikováno v:
Discrete Applied Mathematics 261:40-51, 2019
A signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges which corresponds to an assignment of signs to the edges: edges in $\Sigma$ are negative while edges not in $\Sigma$ are positive. A closed walk of a signed graph is balan
Externí odkaz:
http://arxiv.org/abs/1811.03807
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.
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 23 no. 2, special issue..., Iss Special issues (2023)
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at
Externí odkaz:
https://doaj.org/article/92366dece00a44bcbd0104faf6b39ab6