Zobrazeno 1 - 10
of 8 235
pro vyhledávání: '"[info.info-dm]computer science [cs]/discrete mathematics [cs.dm]"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:3 special issue..., Iss Special issues (2023)
We define a q-linear path in a hypergraph H as a sequence (e_1,...,e_L) of edges of H such that |e_i ∩ e_i+1 | ∈ [[1, q]] and e_i ∩ e_j = ∅ if |i − j| > 1. In this paper, we study the connected components associated to these paths when q =
Externí odkaz:
https://doaj.org/article/53dfeb809a0f40b0a4d7ad3d355144de
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
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Discrete Algorithms (2023)
We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model. The cops and t
Externí odkaz:
https://doaj.org/article/a26ef561013f4ec393470e6794bf7a35
Autor:
Nicolas Ollinger, Guillaume Theyssier
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Automata, Logic and Semantics (2022)
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes a bounded
Externí odkaz:
https://doaj.org/article/9769546e799b46f98d5976bd46472489
Autor:
Antoine Dailly, Elżbieta Sidorowicz
Publikováno v:
Discrete Applied Mathematics. 336:109-124
A $k$-edge-weighting of $G$ is a mapping $\omega:E(G)\longrightarrow \{1,\ldots,k\}$. The edge-weighting of $G$ naturally induces a vertex-colouring $\sigma_{\omega}:V(G)\longrightarrow \mathbb{N}$ given by$\sigma_{\omega}(v)=\sum_{u\in N_G(v)}\omega
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::257dbc25fa68514238f265fcaa91d7b2
https://doi.org/10.1016/j.dam.2023.04.005
https://doi.org/10.1016/j.dam.2023.04.005
Autor:
Dimitri Lajou
Publikováno v:
CALDAM 2020
CALDAM 2020, Feb 2020, Hyderabad, India
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM 2020, Feb 2020, Hyderabad, India
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56e8eb80b21151e3073f72c6b47b21d6
https://doi.org/10.1016/j.dam.2021.03.023
https://doi.org/10.1016/j.dam.2021.03.023
Autor:
Julien Bensmail, Foivos Fioravantes
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 23 no. 1, Iss Graph Theory (2021)
In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints. In p
Externí odkaz:
https://doaj.org/article/0cba365fe0f9497f8ae8001936d13598
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 3, Computational..., Iss Special issues (2021)
In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomen
Externí odkaz:
https://doaj.org/article/d3fc0905b1b64835b81ebe8ec96db88d
Autor:
Didier Caucal
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 1, ICGT 2018 (2020)
We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancellative monoids, and groups.
Externí odkaz:
https://doaj.org/article/2797e34add684bb8a65e0f1fdbdf5d75
Autor:
Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Graph Theory (2020)
In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex. The go
Externí odkaz:
https://doaj.org/article/6e70fde30a8f42f19522d3f358164e73