Hardness of Approximation for <i>H</i> -free Edge Modification Problems (Q4973877)

From MaRDI portal
Revision as of 23:48, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7140830
Language Label Description Also known as
English
Hardness of Approximation for <i>H</i> -free Edge Modification Problems
scientific article; zbMATH DE number 7140830

    Statements

    Hardness of Approximation for <i>H</i> -free Edge Modification Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2019
    0 references
    \(H\)-free graphs
    0 references
    hardness of approximation
    0 references
    exponential time hypothesis
    0 references
    fixed-parameter tractability
    0 references
    graph modification problems
    0 references

    Identifiers

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