Updating automata networks
M Noual - 2012 - theses.hal.science
This thesis is concerned with the events and the organisation of events that take place within
networks of abstract predetermined elements called" automata". In these networks, automata …
networks of abstract predetermined elements called" automata". In these networks, automata …
The complexity of Free-Flood-It on 2× n boards
We consider the complexity of problems related to the combinatorial game Free-Flood-It, in
which players aim to make a coloured graph monochromatic with the minimum possible …
which players aim to make a coloured graph monochromatic with the minimum possible …
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers Page 1 Discrete
Mathematics and Theoretical Computer Science DMTCS vol. 16:3, 2014, 279–290 An …
Mathematics and Theoretical Computer Science DMTCS vol. 16:3, 2014, 279–290 An …
Spanning trees and the complexity of flood-filling games
We consider problems related to the combinatorial game (Free-) Flood-It, in which players
aim to make a coloured graph monochromatic with the minimum possible number of …
aim to make a coloured graph monochromatic with the minimum possible number of …
Parameterized complexity of flood-filling games on trees
This work presents new results on flood-filling games, Flood-It and Free-Flood-It, in which
the player aims to make the board monochromatic with a minimum number of flooding …
the player aims to make the board monochromatic with a minimum number of flooding …
[HTML][HTML] Tractability and hardness of flood-filling games on trees
This work presents new results on flood-filling games, Flood-It and Free-Flood-It, in which
the player aims to make the board monochromatic with a minimum number of flooding …
the player aims to make the board monochromatic with a minimum number of flooding …
Efficient approaches for the Flooding Problem on graphs
ARV da Silva, LS Ochi, BJS Barros… - Annals of Operations …, 2020 - Springer
This paper deals with the Flooding Problem on graphs. This problem consists in finding the
shortest sequence of flooding moves that turns a colored graph into a monochromatic one …
shortest sequence of flooding moves that turns a colored graph into a monochromatic one …
The complexity of shortest common supersequence for inputs with no identical consecutive letters
A Lagoutte, S Tavenas - arxiv preprint arxiv:1309.0422, 2013 - arxiv.org
The Shortest Common Supersequence problem (SCS for short) consists in finding a shortest
common supersequence of a finite set of words on a fixed alphabet Sigma. It is well-known …
common supersequence of a finite set of words on a fixed alphabet Sigma. It is well-known …
On complexity of flooding games on graphs with interval representations
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of
coloring games and they have been becoming popular online. In these games, each player …
coloring games and they have been becoming popular online. In these games, each player …
[HTML][HTML] Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number
Flood-It is a combinatorial problem on a colored graph whose aim is to make the graph
monochromatic using the minimum number of flooding moves, relatively to a pivot vertex p …
monochromatic using the minimum number of flooding moves, relatively to a pivot vertex p …