Pages that link to "Item:Q388453"
From MaRDI portal
The following pages link to The complexity of free-flood-it on \(2\times n\) boards (Q388453):
Displaying 9 items.
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- The complexity of flood-filling games on graphs (Q423894) (← 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)
- Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Flooding games on graphs (Q2448890) (← links)
- (Q3305723) (← links)
- How Bad is the Freedom to Flood-It? (Q4622773) (← links)
