The Flood-It game parameterized by the vertex cover number (Q324714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of flood filling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic analysis of the Honey-Bee game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flooding games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of flood-filling games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of free-flood-it on \(2\times n\) boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees and the complexity of flood-filling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Flood-Filling Games on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5173160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and hardness of flood-filling games on trees / rank
 
Normal rank

Revision as of 17:33, 12 July 2024

scientific article
Language Label Description Also known as
English
The Flood-It game parameterized by the vertex cover number
scientific article

    Statements

    The Flood-It game parameterized by the vertex cover number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2016
    0 references
    Flood-It
    0 references
    fixed-parameter tractability
    0 references
    polynomial kernelization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references