Pages that link to "Item:Q2344738"
From MaRDI portal
The following pages link to Tractability and hardness of flood-filling games on trees (Q2344738):
Displaying 7 items.
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- The complexity of free-flood-it on \(2\times n\) boards (Q388453) (← links)
- Spanning trees and the complexity of flood-filling games (Q489766) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- How bad is the freedom to Flood-It? (Q3305723) (← links)
- How Bad is the Freedom to Flood-It? (Q4622773) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)