A polynomial kernel for diamond-free editing (Q2072105): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3214811907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy Results on the Hardness of $H$-free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximation for <i>H</i> -free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility of \(H\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing: kernelization based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / 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 complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two edge modification problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for paw-free edge modification problems / rank
 
Normal rank

Latest revision as of 21:06, 27 July 2024

scientific article
Language Label Description Also known as
English
A polynomial kernel for diamond-free editing
scientific article

    Statements

    A polynomial kernel for diamond-free editing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2022
    0 references
    kernelization
    0 references
    diamond-free graph
    0 references
    \(H\)-free editing
    0 references
    graph modification problem
    0 references

    Identifiers