Tight Running Time Lower Bounds for Vertex Deletion Problems (Q4973874)

From MaRDI portal
Revision as of 13:40, 28 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129980865, #quickstatements; #temporary_batch_1724848174377)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7140827
Language Label Description Also known as
English
Tight Running Time Lower Bounds for Vertex Deletion Problems
scientific article; zbMATH DE number 7140827

    Statements

    Tight Running Time Lower Bounds for Vertex Deletion Problems (English)
    0 references
    6 December 2019
    0 references
    fine-grain complexity analysis
    0 references
    exponential time hypothesis
    0 references
    graph properties
    0 references

    Identifiers

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