scientific article
From MaRDI portal
Publication:3305723
DOI10.4230/LIPIcs.FUN.2018.5zbMath1489.05102MaRDI QIDQ3305723
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Yota Otachi, Michael Lampis
Publication date: 11 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
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
- Algorithmic meta-theorems for restrictions of treewidth
- Tractability and hardness of flood-filling games on trees
- Flooding games on graphs
- Parametrized complexity theory.
- On Complexity of Flooding Games on Graphs with Interval Representations
- Parameterized Algorithms for Modular-Width
- Parameterized Algorithms
This page was built for publication:
