How Bad is the Freedom to Flood-It?
From MaRDI portal
Publication:4622773
DOI10.7155/jgaa.00486zbMath1405.05112arXiv1804.08236OpenAlexW2911465928WikidataQ128457627 ScholiaQ128457627MaRDI QIDQ4622773
Michael Lampis, Masashi Kiyomi, Yota Otachi, Mehdi Khosravian Ghadikolaei, Rémy Belmonte
Publication date: 14 February 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.08236
Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- The complexity of free-flood-it on \(2\times n\) boards
- The complexity of flood-filling games on graphs
- Spanning trees and the complexity of flood-filling games
- The complexity of flood filling games
- An algorithmic analysis of the Honey-Bee game
- On problems without polynomial kernels
- Modular decomposition and transitive orientation
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- Algorithmic meta-theorems for restrictions of treewidth
- Linear time solvable optimization problems on graphs of bounded clique-width
- Tractability and hardness of flood-filling games on trees
- On the Grundy number of Cameron graphs
- Flooding games on graphs
- Parametrized complexity theory.
- On Complexity of Flooding Games on Graphs with Interval Representations
- Parameterized Algorithms for Modular-Width
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Kernelization Lower Bounds Through Colors and IDs
- Approximating rank-width and clique-width quickly
- Extremal properties of flood-filling games
- Parameterized Algorithms
- A Survey on the Complexity of Flood-Filling Games
This page was built for publication: How Bad is the Freedom to Flood-It?
