Polynomial kernelization for removing induced claws and diamonds (Q2398208): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59529120 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115674935 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.00704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Parameterized Algorithm for Proper Interval Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithm for Interval Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generating Triangle-Free 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: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / 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: Exploring the Subexponential Complexity of Completion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial kernel for trivially perfect editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Kernel for Proper Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms for Deletion to Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of induced graph matching on claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / 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: Line Graphs of Helly Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem / rank
 
Normal rank

Latest revision as of 07:01, 14 July 2024

scientific article
Language Label Description Also known as
English
Polynomial kernelization for removing induced claws and diamonds
scientific article

    Statements

    Polynomial kernelization for removing induced claws and diamonds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2017
    0 references
    edge deletion
    0 references
    parameterized complexity
    0 references
    polynomial kernel
    0 references
    \{claw, diamond\}-free graphs
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references