1 citations · 1 across the 3 of their papers we have counts for
5 papers
Generation of Maximal Snake Polyominoes Using a Deep Neural Network
Benjamin Gauthier, Alain Goupil, Fadel Toure
Maximal snake polyominoes are difficult to study numerically in large rectangles, as computing them requires the complete enumeration of all snakes for a specific rectangle size, w…
Fully Leafed Induced Subtrees in Penrose P2 Tilings
Mathieu Cloutier, Alain Goupil, Alexandre Blondin Massé
In a recent article by C. Porrier, A. Blondin Massé and A. Goupil, a first bi-infinite fully leafed induced subcaterpillar of Penrose P2 tilings is presented. In this paper, we for…
Maximal 2-dimensional binary words of bounded degree
Alexandre Blondin Massé, Alain Goupil, Ralphael L'Heureux +1
Let d be an integer between 0 and 4, and W be a 2-dimensional word of dimensions h x w on the binary alphabet {0, 1}, where h, w in Z > 0. Assume that each occurrence of the letter…
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality
Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil +1
In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the dire…
The Leaf Function of Penrose P2 Graphs
Carole Porrier, Alain Goupil, Alexandre Blondin Massé
We study a graph-theoretic problem in the Penrose P2-graphs which are the dual graphs of Penrose tilings by kites and darts. Using substitutions, local isomorphism and other proper…