Incompressibility of \(H\)-free edge modification problems (Q2343091): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s00453-014-9937-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155453078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong normalization for non-structural subtyping via saturated sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility of H-Free Edge Modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two edge modification problems without polynomial kernels / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:34, 10 July 2024

scientific article
Language Label Description Also known as
English
Incompressibility of \(H\)-free edge modification problems
scientific article

    Statements

    Incompressibility of \(H\)-free edge modification problems (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2015
    0 references
    parameterized complexity
    0 references
    polynomial kernel
    0 references
    polynomial compression
    0 references
    incompressibility
    0 references
    edge modification
    0 references

    Identifiers