Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Alain Goupil"'
Autor:
Alain Goupil, Hugo Cloutier
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size $b\times k \times h$ and of minimal vo
Externí odkaz:
https://doaj.org/article/8ec6d6f033c44b0cb74a645701fe7baa
We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and polycubes \em
Externí odkaz:
http://arxiv.org/abs/1803.09181
Autor:
Alain, Goupil, Hugo, Cloutier
We introduce a family of 3D combinatorial objects that we define as minimal 3D polyominoes inscribed in a rectanglar prism. These objects are connected sets of unitary cubic cells inscribed in a given rectangular prism and of minimal volume under thi
Externí odkaz:
http://arxiv.org/abs/1009.4859
Publikováno v:
Discrete Applied Mathematics. 236:223-234
The goal of this paper is to study the family of snake polyominoes. More precisely, we focus our attention on the class of partially directed snakes. We establish functional equations and length generating functions of two dimensional, three dimensio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7af7d26445495645041b24fc2a8f6274
https://doi.org/10.1016/j.dam.2017.09.003
https://doi.org/10.1016/j.dam.2017.09.003
We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and polycubes ful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d54caa09197dc8b961faefa19c4db10
http://arxiv.org/abs/1803.09181
http://arxiv.org/abs/1803.09181
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319788241
IWOCA
IWOCA
We present and prove recursive formulas giving the maximal number of leaves in tree-like polyominoes and polycubes of size n. We call these tree-like polyforms fully leafed. The proof relies on a combinatorial algorithm that enumerates rooted directe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b669b5aaa6bf3d0a4c774150541fba1e
https://doi.org/10.1007/978-3-319-78825-8_17
https://doi.org/10.1007/978-3-319-78825-8_17
Autor:
Alain Goupil, Alexandre Blondin Massé, Julien de Carufel, Mélodie Lapointe, Émile Nadeau, Elise Vandomme
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319946665
IWOCA
IWOCA
We consider the problem \(\mathrm {LIS}\) of deciding whether there exists an induced subtree with exactly \(i \le n\) vertices and \(\ell \) leaves in a given graph G with n vertices. We study the associated optimization problem, that consists in co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a236f8f9c42c4a23e23032643e981d3f
https://doi.org/10.1007/978-3-319-94667-2_8
https://doi.org/10.1007/978-3-319-94667-2_8
Autor:
Alain Goupil, Mélodie Lapointe, Julien de Carufel, Elise Vandomme, Alexandre Blondin Massé, Émile Nadeau
Given a simple graph $G$ with $n$ vertices and a natural number $i \leq n$, let $L_G(i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with $i$ vertices. We introduce a problem that we call the \emph{leaf reali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::760cce53d4f2a7c6c8aca73783ac913b
http://arxiv.org/abs/1712.01942
http://arxiv.org/abs/1712.01942
Publikováno v:
Theoretical Computer Science. 502:76-87
In this paper, we consider the generation of three classes of polyominoes, distinguished by their connectivity type. We present a two-player game called gomino, and we show how this game induces an algorithm to generate these sets of polyominoes acco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ceb8b856aa92835d2d024b9fbfc61bf
https://doi.org/10.1016/j.tcs.2012.02.032
https://doi.org/10.1016/j.tcs.2012.02.032
Publikováno v:
Discrete Applied Mathematics. 161:151-166
The goal of this paper is to propose a method to construct exact expressions and generating functions for the enumeration of general polyominoes up to translation with respect to area. We illustrate the proposed method with the construction of the ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7146b86def25aa8cd72c2c6c4a44938
https://doi.org/10.1016/j.dam.2012.08.017
https://doi.org/10.1016/j.dam.2012.08.017