Approximability results for the maximum and minimum maximal induced matching problems (Q937401): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in intersection graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum induced matching in weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / 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: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in combinatorial analysis and graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundancy in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / 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: Maximum induced matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P k Partition Problem and Related Problems in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced matchings / 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: Q3002782 / rank
 
Normal rank

Latest revision as of 14:38, 28 June 2024

scientific article
Language Label Description Also known as
English
Approximability results for the maximum and minimum maximal induced matching problems
scientific article

    Statements

    Approximability results for the maximum and minimum maximal induced matching problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    induced matching
    0 references
    bipartite graph
    0 references
    approximability
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references