Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generating Triangle-Free Graphs / 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: Polynomial kernels for paw-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Kernel for Diamond-Free Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2k\) kernel for the cluster editing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / 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: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion / rank
 
Normal rank

Revision as of 17:51, 24 July 2024

scientific article
Language Label Description Also known as
English
Kernel for \(K_t\)\textsc{-free Edge Deletion}
scientific article

    Statements

    Identifiers