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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ivan A. Bliznets / rank
Normal rank
 
Property / author
 
Property / author: Ivan A. Bliznets / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3196834 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963777460 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:48, 19 March 2024

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