A Polynomial Kernel for Line Graph Deletion (Q5874512): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
A Polynomial Kernel for Line Graph Deletion
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081984875 / rank
 
Normal rank
Property / title
 
A Polynomial Kernel for Line Graph Deletion (English)
Property / title: A Polynomial Kernel for Line Graph Deletion (English) / 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: Characterizations of derived graphs / 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: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernelization for removing induced claws and diamonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic algorithm for line graph recognition / 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: Q5572939 / 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: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruent Graphs and the Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Latest revision as of 11:08, 31 July 2024

scientific article; zbMATH DE number 7651181
Language Label Description Also known as
English
A Polynomial Kernel for Line Graph Deletion
scientific article; zbMATH DE number 7651181

    Statements

    0 references
    0 references
    7 February 2023
    0 references
    kernelization
    0 references
    line graphs
    0 references
    \(H\)-free editing
    0 references
    graph modification problem
    0 references
    A Polynomial Kernel for Line Graph Deletion (English)
    0 references

    Identifiers