Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484)

From MaRDI portal
Revision as of 07:36, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized complexity of computing maximum minimal blocking and hitting sets
scientific article

    Statements

    Parameterized complexity of computing maximum minimal blocking and hitting sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 February 2023
    0 references
    maximum minimal blocking set
    0 references
    maximum minimal hitting set
    0 references
    parameterized complexity
    0 references
    treewidth
    0 references
    kernelization
    0 references
    vertex cover
    0 references
    upper domination
    0 references

    Identifiers

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