On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:42, 5 March 2024

scientific article
Language Label Description Also known as
English
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
scientific article

    Statements

    On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2019
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    vertex deletion problems
    0 references

    Identifiers