Parameterized algorithms and kernels for almost induced matching (Q2210504): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximal Induced Matchings in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the maximum induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2955012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundancy in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Domination and Simultaneous Matroid Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of the induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability results for the maximum and minimum maximal induced matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved kernelization for \(P_{2}\)-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum induced matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Induced Matching: Linear Kernels and Parameterized Algorithms / rank
 
Normal rank

Latest revision as of 00:39, 24 July 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms and kernels for almost induced matching
scientific article

    Statements

    Parameterized algorithms and kernels for almost induced matching (English)
    0 references
    0 references
    0 references
    6 November 2020
    0 references
    maximum induced matching
    0 references
    linear kernel
    0 references
    parameterized algorithms
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

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